Is 964 a prime number?

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

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

The list of all positive divisors (i.e., the list of all integers that divide 964) is as follows: 1, 2, 4, 241, 482, 964.

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

Find out more:

What is a prime number?

As a consequence:

964 is a multiple of 1
964 is a multiple of 2
964 is a multiple of 4
964 is a multiple of 241
964 is a multiple of 482

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

Is 964 a deficient number?

Yes, 964 is a deficient number, that is to say 964 is a natural number that is strictly larger than the sum of its proper divisors, i.e., the divisors of 964 without 964 itself (that is 1 + 2 + 4 + 241 + 482 = 730).

Parity of 964

964 is an even number, because it is evenly divisible by 2: 964 / 2 = 482.

Find out more:

What is an even number?

Is 964 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 964 is about 31.048.

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

What is the square number of 964?

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

The square of 964 is 929 296 because 964 × 964 = 964² = 929 296.

As a consequence, 964 is the square root of 929 296.

Number of digits of 964

964 is a number with 3 digits.

What are the multiples of 964?

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

0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 964 too, since 0 × 964 = 0
964: indeed, 964 is a multiple of itself, since 964 is evenly divisible by 964 (we have 964 / 964 = 1, so the remainder of this division is indeed zero)
1 928: indeed, 1 928 = 964 × 2
2 892: indeed, 2 892 = 964 × 3
3 856: indeed, 3 856 = 964 × 4
4 820: indeed, 4 820 = 964 × 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 964). 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 31.048). 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 964

Preceding numbers: …962, 963
Following numbers: 965, 966…

Nearest numbers from 964

Preceding prime number: 953
Following prime number: 967