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

## Is 807 a prime number?

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

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

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

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

As a consequence:

• 807 is a multiple of 1
• 807 is a multiple of 3
• 807 is a multiple of 269

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

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

## Is 807 a deficient number?

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

## Parity of 807

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

## Is 807 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 807 is about 28.408.

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

## What is the square number of 807?

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

The square of 807 is 651 249 because 807 × 807 = 8072 = 651 249.

As a consequence, 807 is the square root of 651 249.

## Number of digits of 807

807 is a number with 3 digits.

## What are the multiples of 807?

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

• 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 807 too, since 0 × 807 = 0
• 807: indeed, 807 is a multiple of itself, since 807 is evenly divisible by 807 (we have 807 / 807 = 1, so the remainder of this division is indeed zero)
• 1 614: indeed, 1 614 = 807 × 2
• 2 421: indeed, 2 421 = 807 × 3
• 3 228: indeed, 3 228 = 807 × 4
• 4 035: indeed, 4 035 = 807 × 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 807). 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 28.408). 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 807

• Preceding numbers: …805, 806
• Following numbers: 808, 809

## Nearest numbers from 807

• Preceding prime number: 797
• Following prime number: 809
Find out whether some integer is a prime number