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

Is 862 a prime number?

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

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

The list of all positive divisors (i.e., the list of all integers that divide 862) is as follows: 1, 2, 431, 862.

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

As a consequence:

  • 862 is a multiple of 1
  • 862 is a multiple of 2
  • 862 is a multiple of 431

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

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

Is 862 a deficient number?

Yes, 862 is a deficient number, that is to say 862 is a natural number that is strictly larger than the sum of its proper divisors, i.e., the divisors of 862 without 862 itself (that is 1 + 2 + 431 = 434).

Parity of 862

862 is an even number, because it is evenly divisible by 2: 862 / 2 = 431.

Is 862 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 862 is about 29.360.

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

What is the square number of 862?

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

The square of 862 is 743 044 because 862 × 862 = 8622 = 743 044.

As a consequence, 862 is the square root of 743 044.

Number of digits of 862

862 is a number with 3 digits.

What are the multiples of 862?

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

  • 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 862 too, since 0 × 862 = 0
  • 862: indeed, 862 is a multiple of itself, since 862 is evenly divisible by 862 (we have 862 / 862 = 1, so the remainder of this division is indeed zero)
  • 1 724: indeed, 1 724 = 862 × 2
  • 2 586: indeed, 2 586 = 862 × 3
  • 3 448: indeed, 3 448 = 862 × 4
  • 4 310: indeed, 4 310 = 862 × 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 862). 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.360). 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 862

  • Preceding numbers: …860, 861
  • Following numbers: 863, 864

Nearest numbers from 862

  • Preceding prime number: 859
  • Following prime number: 863
Find out whether some integer is a prime number