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

Parity of 867

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

Find out more:

Is 867 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 867 is about 29.445.

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

What is the square number of 867?

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

The square of 867 is 751 689 because 867 × 867 = 8672 = 751 689.

As a consequence, 867 is the square root of 751 689.

Number of digits of 867

867 is a number with 3 digits.

What are the multiples of 867?

The multiples of 867 are all integers evenly divisible by 867, that is all numbers such that the remainder of the division by 867 is zero. There are infinitely many multiples of 867. The smallest multiples of 867 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 867). 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.445). 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 867

  • Preceding numbers: …865, 866
  • Following numbers: 868, 869

Nearest numbers from 867

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