Is 927 a prime number?

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

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

The list of all positive divisors (i.e., the list of all integers that divide 927) is as follows: 1, 3, 9, 103, 309, 927.

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

Find out more:

What is a prime number?

As a consequence:

927 is a multiple of 1
927 is a multiple of 3
927 is a multiple of 9
927 is a multiple of 103
927 is a multiple of 309

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

Is 927 a deficient number?

Yes, 927 is a deficient number, that is to say 927 is a natural number that is strictly larger than the sum of its proper divisors, i.e., the divisors of 927 without 927 itself (that is 1 + 3 + 9 + 103 + 309 = 425).

Parity of 927

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

Find out more:

What is an even number?

Is 927 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 927 is about 30.447.

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

What is the square number of 927?

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

The square of 927 is 859 329 because 927 × 927 = 927² = 859 329.

As a consequence, 927 is the square root of 859 329.

Number of digits of 927

927 is a number with 3 digits.

What are the multiples of 927?

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

0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 927 too, since 0 × 927 = 0
927: indeed, 927 is a multiple of itself, since 927 is evenly divisible by 927 (we have 927 / 927 = 1, so the remainder of this division is indeed zero)
1 854: indeed, 1 854 = 927 × 2
2 781: indeed, 2 781 = 927 × 3
3 708: indeed, 3 708 = 927 × 4
4 635: indeed, 4 635 = 927 × 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 927). 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.447). 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 927

Preceding numbers: …925, 926
Following numbers: 928, 929…

Nearest numbers from 927

Preceding prime number: 919
Following prime number: 929