Is 101501 a prime number?

101 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 101 501 is about 318.592.

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

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

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

The square of 101 501 is 10 302 453 001 because 101 501 × 101 501 = 101 501² = 10 302 453 001.

As a consequence, 101 501 is the square root of 10 302 453 001.

101 501 is a number with 6 digits.

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

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

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

Nearest numbers from 101 501

• Preceding prime number: 101 489
• Following prime number: 101 503

• 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 9585 a prime number?

• Five thousand prime numbers

• Contact

• 101 501 est-il un nombre premier ?