Is 931 a prime number?

It is possible to find out using mathematical methods whether a given integer is a prime number or not.

For 931, the answer is: No, 931 is not a prime number.

The list of all positive divisors (i.e., the list of all integers that divide 931) is as follows: 1, 7, 19, 49, 133, 931.

For 931 to be a prime number, it would have been required that 931 has only two divisors, i.e., itself and 1.

Find out more:

What is a prime number?

As a consequence:

931 is a multiple of 1
931 is a multiple of 7
931 is a multiple of 19
931 is a multiple of 49
931 is a multiple of 133

For 931 to be a prime number, it would have been required that 931 has only two divisors, i.e., itself and 1.

Is 931 a deficient number?

Yes, 931 is a deficient number, that is to say 931 is a natural number that is strictly larger than the sum of its proper divisors, i.e., the divisors of 931 without 931 itself (that is 1 + 7 + 19 + 49 + 133 = 209).

Parity of 931

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

Find out more:

What is an even number?

Is 931 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 931 is about 30.512.

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

What is the square number of 931?

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

The square of 931 is 866 761 because 931 × 931 = 931² = 866 761.

As a consequence, 931 is the square root of 866 761.

Number of digits of 931

931 is a number with 3 digits.

What are the multiples of 931?

The multiples of 931 are all integers evenly divisible by 931, that is all numbers such that the remainder of the division by 931 is zero. There are infinitely many multiples of 931. The smallest multiples of 931 are:

0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 931 too, since 0 × 931 = 0
931: indeed, 931 is a multiple of itself, since 931 is evenly divisible by 931 (we have 931 / 931 = 1, so the remainder of this division is indeed zero)
1 862: indeed, 1 862 = 931 × 2
2 793: indeed, 2 793 = 931 × 3
3 724: indeed, 3 724 = 931 × 4
4 655: indeed, 4 655 = 931 × 5
etc.

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 931). 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.512). 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 931

Preceding numbers: …929, 930
Following numbers: 932, 933…

Nearest numbers from 931

Preceding prime number: 929
Following prime number: 937