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

Is 151 a prime number?

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

For 151, the answer is: yes, 151 is a prime number because it has only two distinct divisors: 1 and itself (151).

As a consequence, 151 is only a multiple of 1 and 151..

Since 151 is a prime number, 151 is also a deficient number, that is to say 151 is a natural integer that is strictly larger than the sum of its proper divisors, i.e., the divisors of 151 without 151 itself (that is 1, by definition!).

Parity of 151

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

Is 151 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 151 is about 12.288.

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

Anyway, 151 is a prime number, and a prime number cannot be a perfect square.

What is the square number of 151?

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

The square of 151 is 22 801 because 151 × 151 = 1512 = 22 801.

As a consequence, 151 is the square root of 22 801.

Number of digits of 151

151 is a number with 3 digits.

What are the multiples of 151?

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

  • 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 151 too, since 0 × 151 = 0
  • 151: indeed, 151 is a multiple of itself, since 151 is evenly divisible by 151 (we have 151 / 151 = 1, so the remainder of this division is indeed zero)
  • 302: indeed, 302 = 151 × 2
  • 453: indeed, 453 = 151 × 3
  • 604: indeed, 604 = 151 × 4
  • 755: indeed, 755 = 151 × 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 151). 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.288). 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 151

  • Preceding numbers: …149, 150
  • Following numbers: 152, 153

Nearest numbers from 151

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