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

Parity of 987

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

Find out more:

Is 987 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 987 is about 31.417.

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

What is the square number of 987?

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

The square of 987 is 974 169 because 987 × 987 = 9872 = 974 169.

As a consequence, 987 is the square root of 974 169.

Number of digits of 987

987 is a number with 3 digits.

What are the multiples of 987?

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

  • Preceding numbers: …985, 986
  • Following numbers: 988, 989

Nearest numbers from 987

  • Preceding prime number: 983
  • Following prime number: 991
Find out whether some integer is a prime number