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

Parity of 901

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

Find out more:

Is 901 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 901 is about 30.017.

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

What is the square number of 901?

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

The square of 901 is 811 801 because 901 × 901 = 9012 = 811 801.

As a consequence, 901 is the square root of 811 801.

Number of digits of 901

901 is a number with 3 digits.

What are the multiples of 901?

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

  • Preceding numbers: …899, 900
  • Following numbers: 902, 903

Nearest numbers from 901

  • Preceding prime number: 887
  • Following prime number: 907
Find out whether some integer is a prime number