Is 873 a prime number? What are the divisors of 873?

Parity of 873

873 is an odd number, because it is not evenly divisible by 2.

Find out more:

Is 873 a perfect square number?

A number is a perfect square (or a square number) if its square root is an integer; that is to say, it is the product of an integer with itself. Here, the square root of 873 is about 29.547.

Thus, the square root of 873 is not an integer, and therefore 873 is not a square number.

What is the square number of 873?

The square of a number (here 873) is the result of the product of this number (873) by itself (i.e., 873 × 873); the square of 873 is sometimes called "raising 873 to the power 2", or "873 squared".

The square of 873 is 762 129 because 873 × 873 = 8732 = 762 129.

As a consequence, 873 is the square root of 762 129.

Number of digits of 873

873 is a number with 3 digits.

What are the multiples of 873?

The multiples of 873 are all integers evenly divisible by 873, that is all numbers such that the remainder of the division by 873 is zero. There are infinitely many multiples of 873. The smallest multiples of 873 are:

How to determine whether an integer is a prime number?

To determine the primality of a number, several algorithms can be used. The most naive technique is to test all divisors strictly smaller to the number of which we want to determine the primality (here 873). First, we can eliminate all even numbers greater than 2 (and hence 4, 6, 8…). Then, we can stop this check when we reach the square root of the number of which we want to determine the primality (here the square root is about 29.547). Historically, the sieve of Eratosthenes (dating from the Greek mathematics) implements this technique in a relatively efficient manner.

More modern techniques include the sieve of Atkin, probabilistic algorithms, and the cyclotomic AKS test.

Numbers near 873

  • Preceding numbers: …871, 872
  • Following numbers: 874, 875

Nearest numbers from 873

  • Preceding prime number: 863
  • Following prime number: 877
Find out whether some integer is a prime number