Is 847 a prime number?

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

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

The list of all positive divisors (i.e., the list of all integers that divide 847) is as follows: 1, 7, 11, 77, 121, 847.

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

Find out more:

What is a prime number?

As a consequence:

847 is a multiple of 1
847 is a multiple of 7
847 is a multiple of 11
847 is a multiple of 77
847 is a multiple of 121

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

Is 847 a deficient number?

Yes, 847 is a deficient number, that is to say 847 is a natural number that is strictly larger than the sum of its proper divisors, i.e., the divisors of 847 without 847 itself (that is 1 + 7 + 11 + 77 + 121 = 217).

Parity of 847

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

Find out more:

What is an even number?

Is 847 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 847 is about 29.103.

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

What is the square number of 847?

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

The square of 847 is 717 409 because 847 × 847 = 847² = 717 409.

As a consequence, 847 is the square root of 717 409.

Number of digits of 847

847 is a number with 3 digits.

What are the multiples of 847?

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

0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 847 too, since 0 × 847 = 0
847: indeed, 847 is a multiple of itself, since 847 is evenly divisible by 847 (we have 847 / 847 = 1, so the remainder of this division is indeed zero)
1 694: indeed, 1 694 = 847 × 2
2 541: indeed, 2 541 = 847 × 3
3 388: indeed, 3 388 = 847 × 4
4 235: indeed, 4 235 = 847 × 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 847). 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 29.103). 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 847

Preceding numbers: …845, 846
Following numbers: 848, 849…

Nearest numbers from 847

Preceding prime number: 839
Following prime number: 853