The number 5002
5002 is a composite number with 8 divisors. Its prime factorisation is 2 × 41 × 61. Divisors (8): 1, 2, 41, 61, 82, 122, 2501, 5002.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5002 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5002 is composite. Its prime factorisation is
- 3
The divisors add up to 7812; without 5002 itself that is 2810, so 5002 is deficient (2810 is less than 5002). Euler's totient φ(5002) = 2400 numbers up to 5002 share no factor with it.
- 4
The digits of 5002 add up to 7, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 28 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5002 = 2 \times 41 \times 61 \]
5002 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 7812 |
| Euler totient φ(n) | 2400 |
| Square | 25020004 |
| Cube | 125150060008 |
| Square root | 70.724819 |
| Digit sum / digital root | 7 / 7 |
| Collatz steps to 1 | 28 |
| Scientific notation | 5.002 × |
5002 in other forms
| Form | Value |
|---|---|
| In words | five thousand and two |
| Binary (base 2) | 1001110001010 |
| Octal (base 8) | 11612 |
| Hexadecimal (base 16) | 138A |
| Base 3 | 20212021 |
| As time | 5002 seconds = 1 h 23 min 22 s |
Is 5002 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5002 ÷ 2 = 2501) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5002 a prime number?
No. 5002 = 2 × 41 × 61, so it is divisible by 2.
What are the factors of 5002?
1, 2, 41, 61, 82, 122, 2501, 5002.
What is 5002 in binary?
1001110001010 (hexadecimal 138A, octal 11612).
What is the square root of 5002?
About 70.7248.
Is 5002 divisible by 3?
No. Its digits add up to 7, which is not a multiple of 3.
What is special about the number 5002?
It is a composite number with 8 divisors.