Is 136501 a prime number?

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

Find out more:

• What is an even 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 501 is about 369.460.

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

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

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

The square of 136 501 is 18 632 523 001 because 136 501 × 136 501 = 136 501² = 18 632 523 001.

As a consequence, 136 501 is the square root of 18 632 523 001.

136 501 is a number with 6 digits.

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

• 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 136 501 too, since 0 × 136 501 = 0
• 136 501: indeed, 136 501 is a multiple of itself, since 136 501 is evenly divisible by 136 501 (we have 136 501 / 136 501 = 1, so the remainder of this division is indeed zero)
• 273 002: indeed, 273 002 = 136 501 × 2
• 409 503: indeed, 409 503 = 136 501 × 3
• 546 004: indeed, 546 004 = 136 501 × 4
• 682 505: indeed, 682 505 = 136 501 × 5
• etc.

• Preceding numbers: …136 499, 136 500
• Following numbers: 136 502, 136 503…

Nearest numbers from 136 501

• Preceding prime number: 136 483
• Following prime number: 136 511

• Is 0 a prime number?
• Is 1 a prime number?
• Is 2 a prime number?
• Is 2024 a prime number?
• Is 2025 a prime number?
• Is 2686 a prime number?

• Five thousand prime numbers

• Contact

• 136 501 est-il un nombre premier ?