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

Parity of 160

160 is an even number, because it is evenly divisible by 2: 160 / 2 = 80.

Find out more:

Is 160 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 160 is about 12.649.

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

What is the square number of 160?

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

The square of 160 is 25 600 because 160 × 160 = 1602 = 25 600.

As a consequence, 160 is the square root of 25 600.

Number of digits of 160

160 is a number with 3 digits.

What are the multiples of 160?

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

  • 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 160 too, since 0 × 160 = 0
  • 160: indeed, 160 is a multiple of itself, since 160 is evenly divisible by 160 (we have 160 / 160 = 1, so the remainder of this division is indeed zero)
  • 320: indeed, 320 = 160 × 2
  • 480: indeed, 480 = 160 × 3
  • 640: indeed, 640 = 160 × 4
  • 800: indeed, 800 = 160 × 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 160). 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.649). 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 160

  • Preceding numbers: …158, 159
  • Following numbers: 161, 162…

Nearest numbers from 160

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