The number 1502
1502 is a composite number with 4 divisors. Its prime factorisation is 2 × 751. Divisors (4): 1, 2, 751, 1502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1502: a semiprime: 2 × 751, the product of two primes.
- 2
1502 is composite. Its prime factorisation is
- 3
The divisors add up to 2256; without 1502 itself that is 754, so 1502 is deficient (754 is less than 1502). Euler's totient φ(1502) = 750 numbers up to 1502 share no factor with it.
- 4
The digits of 1502 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1502 = 2 \times 751 \]
1502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2256 |
| Euler totient φ(n) | 750 |
| Square | 2256004 |
| Cube | 3388518008 |
| Square root | 38.755645 |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 140 |
| Scientific notation | 1.502 × |
1502 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and two |
| Roman numerals | MDII |
| Binary (base 2) | 10111011110 |
| Octal (base 8) | 2736 |
| Hexadecimal (base 16) | 5DE |
| Base 3 | 2001122 |
| As time | 1502 seconds = 25 min 2 s |
Is 1502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1502 ÷ 2 = 751) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | No (remainder 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1502 a prime number?
No. 1502 = 2 × 751, so it is divisible by 2.
What are the factors of 1502?
1, 2, 751, 1502.
What is 1502 in binary?
10111011110 (hexadecimal 5DE, octal 2736).
What is the square root of 1502?
About 38.7556.
What is 1502 in Roman numerals?
MDII.
Is 1502 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 1502?
1502 is a semiprime: 2 × 751, the product of two primes.