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

Parity of 162

162 is an even number, because it is evenly divisible by 2: 162 / 2 = 81.

Find out more:

Is 162 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 162 is about 12.728.

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

What is the square number of 162?

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

The square of 162 is 26 244 because 162 × 162 = 1622 = 26 244.

As a consequence, 162 is the square root of 26 244.

Number of digits of 162

162 is a number with 3 digits.

What are the multiples of 162?

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

  • 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 162 too, since 0 × 162 = 0
  • 162: indeed, 162 is a multiple of itself, since 162 is evenly divisible by 162 (we have 162 / 162 = 1, so the remainder of this division is indeed zero)
  • 324: indeed, 324 = 162 × 2
  • 486: indeed, 486 = 162 × 3
  • 648: indeed, 648 = 162 × 4
  • 810: indeed, 810 = 162 × 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 162). 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 12.728). 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 162

  • Preceding numbers: …160, 161
  • Following numbers: 163, 164…

Nearest numbers from 162

  • Preceding prime number: 157
  • Following prime number: 163
Find out whether some integer is a prime number