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

## Parity of 136

136 is an even number, because it is evenly divisible by 2: 136 / 2 = 68.

Find out more:

## Is 136 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 136 is about 11.662.

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

## What is the square number of 136?

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

The square of 136 is 18 496 because 136 × 136 = 1362 = 18 496.

As a consequence, 136 is the square root of 18 496.

## Number of digits of 136

136 is a number with 3 digits.

## What are the multiples of 136?

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

• 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 136 too, since 0 × 136 = 0
• 136: indeed, 136 is a multiple of itself, since 136 is evenly divisible by 136 (we have 136 / 136 = 1, so the remainder of this division is indeed zero)
• 272: indeed, 272 = 136 × 2
• 408: indeed, 408 = 136 × 3
• 544: indeed, 544 = 136 × 4
• 680: indeed, 680 = 136 × 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 136). 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.662). 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 136

• Preceding numbers: …134, 135
• Following numbers: 137, 138

### Nearest numbers from 136

• Preceding prime number: 131
• Following prime number: 137
Find out whether some integer is a prime number