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

Parity of 147

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

Find out more:

Is 147 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 147 is about 12.124.

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

What is the square number of 147?

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

The square of 147 is 21 609 because 147 × 147 = 1472 = 21 609.

As a consequence, 147 is the square root of 21 609.

Number of digits of 147

147 is a number with 3 digits.

What are the multiples of 147?

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

  • 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 147 too, since 0 × 147 = 0
  • 147: indeed, 147 is a multiple of itself, since 147 is evenly divisible by 147 (we have 147 / 147 = 1, so the remainder of this division is indeed zero)
  • 294: indeed, 294 = 147 × 2
  • 441: indeed, 441 = 147 × 3
  • 588: indeed, 588 = 147 × 4
  • 735: indeed, 735 = 147 × 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 147). 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.124). 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 147

  • Preceding numbers: …145, 146
  • Following numbers: 148, 149…

Nearest numbers from 147

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