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

Parity of 142

142 is an even number, because it is evenly divisible by 2: 142 / 2 = 71.

Find out more:

Is 142 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 142 is about 11.916.

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

What is the square number of 142?

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

The square of 142 is 20 164 because 142 × 142 = 1422 = 20 164.

As a consequence, 142 is the square root of 20 164.

Number of digits of 142

142 is a number with 3 digits.

What are the multiples of 142?

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

  • 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 142 too, since 0 × 142 = 0
  • 142: indeed, 142 is a multiple of itself, since 142 is evenly divisible by 142 (we have 142 / 142 = 1, so the remainder of this division is indeed zero)
  • 284: indeed, 284 = 142 × 2
  • 426: indeed, 426 = 142 × 3
  • 568: indeed, 568 = 142 × 4
  • 710: indeed, 710 = 142 × 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 142). 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 11.916). 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 142

  • Preceding numbers: …140, 141
  • Following numbers: 143, 144…

Nearest numbers from 142

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