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

Parity of 399

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

Find out more:

Is 399 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 399 is about 19.975.

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

What is the square number of 399?

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

The square of 399 is 159 201 because 399 × 399 = 3992 = 159 201.

As a consequence, 399 is the square root of 159 201.

Number of digits of 399

399 is a number with 3 digits.

What are the multiples of 399?

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

  • Preceding numbers: …397, 398
  • Following numbers: 400, 401

Nearest numbers from 399

  • Preceding prime number: 397
  • Following prime number: 401
Find out whether some integer is a prime number