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

Parity of 387

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

Find out more:

Is 387 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 387 is about 19.672.

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

What is the square number of 387?

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

The square of 387 is 149 769 because 387 × 387 = 3872 = 149 769.

As a consequence, 387 is the square root of 149 769.

Number of digits of 387

387 is a number with 3 digits.

What are the multiples of 387?

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

  • Preceding numbers: …385, 386
  • Following numbers: 388, 389

Nearest numbers from 387

  • Preceding prime number: 383
  • Following prime number: 389
Find out whether some integer is a prime number