Is 699 a prime number?

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

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

The list of all positive divisors (i.e., the list of all integers that divide 699) is as follows: 1, 3, 233, 699.

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

Find out more:

What is a prime number?

As a consequence:

699 is a multiple of 1
699 is a multiple of 3
699 is a multiple of 233

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

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

Is 699 a deficient number?

Yes, 699 is a deficient number, that is to say 699 is a natural number that is strictly larger than the sum of its proper divisors, i.e., the divisors of 699 without 699 itself (that is 1 + 3 + 233 = 237).

Parity of 699

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

Find out more:

What is an even number?

Is 699 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 699 is about 26.439.

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

What is the square number of 699?

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

The square of 699 is 488 601 because 699 × 699 = 699² = 488 601.

As a consequence, 699 is the square root of 488 601.

Number of digits of 699

699 is a number with 3 digits.

What are the multiples of 699?

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

0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 699 too, since 0 × 699 = 0
699: indeed, 699 is a multiple of itself, since 699 is evenly divisible by 699 (we have 699 / 699 = 1, so the remainder of this division is indeed zero)
1 398: indeed, 1 398 = 699 × 2
2 097: indeed, 2 097 = 699 × 3
2 796: indeed, 2 796 = 699 × 4
3 495: indeed, 3 495 = 699 × 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 699). 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 26.439). 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 699

Preceding numbers: …697, 698
Following numbers: 700, 701…

Nearest numbers from 699

Preceding prime number: 691
Following prime number: 701