Is 502 a prime number?

It is possible to find out using mathematical methods whether a given integer is a prime number or not.

For 502, the answer is: No, 502 is not a prime number.

The list of all positive divisors (i.e., the list of all integers that divide 502) is as follows: 1, 2, 251, 502.

For 502 to be a prime number, it would have been required that 502 has only two divisors, i.e., itself and 1.

Find out more:

What is a prime number?

As a consequence:

502 is a multiple of 1
502 is a multiple of 2
502 is a multiple of 251

For 502 to be a prime number, it would have been required that 502 has only two divisors, i.e., itself and 1.

However, 502 is a semiprime (also called biprime or 2-almost-prime), because it is the product of a two non-necessarily distinct prime numbers. Indeed, 502 = 2 x 251, where 2 and 251 are both prime numbers.

Is 502 a deficient number?

Yes, 502 is a deficient number, that is to say 502 is a natural number that is strictly larger than the sum of its proper divisors, i.e., the divisors of 502 without 502 itself (that is 1 + 2 + 251 = 254).

Parity of 502

502 is an even number, because it is evenly divisible by 2: 502 / 2 = 251.

Find out more:

What is an even number?

Is 502 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 502 is about 22.405.

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

What is the square number of 502?

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

The square of 502 is 252 004 because 502 × 502 = 502² = 252 004.

As a consequence, 502 is the square root of 252 004.

Number of digits of 502

502 is a number with 3 digits.

What are the multiples of 502?

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

0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 502 too, since 0 × 502 = 0
502: indeed, 502 is a multiple of itself, since 502 is evenly divisible by 502 (we have 502 / 502 = 1, so the remainder of this division is indeed zero)
1 004: indeed, 1 004 = 502 × 2
1 506: indeed, 1 506 = 502 × 3
2 008: indeed, 2 008 = 502 × 4
2 510: indeed, 2 510 = 502 × 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 502). 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 22.405). 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 502

Preceding numbers: …500, 501
Following numbers: 503, 504…

Nearest numbers from 502

Preceding prime number: 499
Following prime number: 503