Is 667 a prime number?

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

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

The list of all positive divisors (i.e., the list of all integers that divide 667) is as follows: 1, 23, 29, 667.

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

Find out more:

What is a prime number?

As a consequence:

667 is a multiple of 1
667 is a multiple of 23
667 is a multiple of 29

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

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

Is 667 a deficient number?

Yes, 667 is a deficient number, that is to say 667 is a natural number that is strictly larger than the sum of its proper divisors, i.e., the divisors of 667 without 667 itself (that is 1 + 23 + 29 = 53).

Parity of 667

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

Find out more:

What is an even number?

Is 667 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 667 is about 25.826.

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

What is the square number of 667?

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

The square of 667 is 444 889 because 667 × 667 = 667² = 444 889.

As a consequence, 667 is the square root of 444 889.

Number of digits of 667

667 is a number with 3 digits.

What are the multiples of 667?

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

0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 667 too, since 0 × 667 = 0
667: indeed, 667 is a multiple of itself, since 667 is evenly divisible by 667 (we have 667 / 667 = 1, so the remainder of this division is indeed zero)
1 334: indeed, 1 334 = 667 × 2
2 001: indeed, 2 001 = 667 × 3
2 668: indeed, 2 668 = 667 × 4
3 335: indeed, 3 335 = 667 × 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 667). 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 25.826). 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 667

Preceding numbers: …665, 666
Following numbers: 668, 669…

Nearest numbers from 667

Preceding prime number: 661
Following prime number: 673