Is 959 a prime number?

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

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

The list of all positive divisors (i.e., the list of all integers that divide 959) is as follows: 1, 7, 137, 959.

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

Find out more:

What is a prime number?

As a consequence:

959 is a multiple of 1
959 is a multiple of 7
959 is a multiple of 137

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

However, 959 is a semiprime (also called biprime or 2-almost-prime), because it is the product of a two non-necessarily distinct prime numbers. Indeed, 959 = 7 x 137, where 7 and 137 are both prime numbers.

Is 959 a deficient number?

Yes, 959 is a deficient number, that is to say 959 is a natural number that is strictly larger than the sum of its proper divisors, i.e., the divisors of 959 without 959 itself (that is 1 + 7 + 137 = 145).

Parity of 959

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

Find out more:

What is an even number?

Is 959 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 959 is about 30.968.

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

What is the square number of 959?

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

The square of 959 is 919 681 because 959 × 959 = 959² = 919 681.

As a consequence, 959 is the square root of 919 681.

Number of digits of 959

959 is a number with 3 digits.

What are the multiples of 959?

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

0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 959 too, since 0 × 959 = 0
959: indeed, 959 is a multiple of itself, since 959 is evenly divisible by 959 (we have 959 / 959 = 1, so the remainder of this division is indeed zero)
1 918: indeed, 1 918 = 959 × 2
2 877: indeed, 2 877 = 959 × 3
3 836: indeed, 3 836 = 959 × 4
4 795: indeed, 4 795 = 959 × 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 959). 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.968). 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 959

Preceding numbers: …957, 958
Following numbers: 960, 961…

Nearest numbers from 959

Preceding prime number: 953
Following prime number: 967