Is 667 a prime number? What are the divisors of 667?

Parity of 667

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

Find out more:

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 = 6672 = 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:

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
Find out whether some integer is a prime number