The number 5004
5004 is a composite number with 18 divisors. Its prime factorisation is × × 139. Divisors (18): 1, 2, 3, 4, 6, 9, 12, 18, 36, 139, 278, 417, 556, 834, 1251, 1668 … 5004.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5004: a Harshad number: divisible by its digit sum 9.
- 2
5004 is composite. Its prime factorisation is
- 3
The divisors add up to 12740; without 5004 itself that is 7736, so 5004 is abundant (7736 is more than 5004). Euler's totient φ(5004) = 1656 numbers up to 5004 share no factor with it.
- 4
The digits of 5004 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 28 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5004 = 2^{2} \times 3^{2} \times 139 \]5004 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 12740 |
| Euler totient φ(n) | 1656 |
| Square | 25040016 |
| Cube | 125300240064 |
| Square root | 70.738957 (= 6√139) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 28 |
| Scientific notation | 5.004 × |
5004 in other forms
| Form | Value |
|---|---|
| In words | five thousand and four |
| Binary (base 2) | 1001110001100 |
| Octal (base 8) | 11614 |
| Hexadecimal (base 16) | 138C |
| Base 3 | 20212100 |
| As time | 5004 seconds = 1 h 23 min 24 s |
Is 5004 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5004 ÷ 2 = 2502) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5004 ÷ 3 = 1668) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (5004 ÷ 4 = 1251) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (5004 ÷ 6 = 834) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (5004 ÷ 9 = 556) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (5004 ÷ 12 = 417) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5004 a prime number?
No. 5004 = × × 139, so it is divisible by 2.
What are the factors of 5004?
1, 2, 3, 4, 6, 9, 12, 18, 36, 139, 278, 417, 556, 834, 1251, 1668, 2502, 5004.
What is 5004 in binary?
1001110001100 (hexadecimal 138C, octal 11614).
What is the square root of 5004?
About 70.7390, exactly 6√139.
Is 5004 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 5004?
5004 is a Harshad number: divisible by its digit sum 9.