The number 52002
52002 is a composite number with 24 divisors. Its prime factorisation is 2 × × 107. Divisors (24): 1, 2, 3, 6, 9, 18, 27, 54, 81, 107, 162, 214, 243, 321, 486, 642 … 52002.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52002: a Harshad number: divisible by its digit sum 9.
- 2
52002 is composite. Its prime factorisation is
- 3
The divisors add up to 117936; without 52002 itself that is 65934, so 52002 is abundant (65934 is more than 52002). Euler's totient φ(52002) = 17172 numbers up to 52002 share no factor with it.
- 4
The digits of 52002 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52002 = 2 \times 3^{5} \times 107 \]52002 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 117936 |
| Euler totient φ(n) | 17172 |
| Square | 2704208004 |
| Cube | 140624224624008 |
| Square root | 228.039470 (= 9√642) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.2002 × |
52002 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand and two |
| Binary (base 2) | 1100101100100010 |
| Octal (base 8) | 145442 |
| Hexadecimal (base 16) | CB22 |
| Base 3 | 2122100000 |
| As time | 52002 seconds = 14 h 26 min 42 s |
Is 52002 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52002 ÷ 2 = 26001) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (52002 ÷ 3 = 17334) | 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 | Yes (52002 ÷ 6 = 8667) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (52002 ÷ 9 = 5778) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52002 a prime number?
No. 52002 = 2 × × 107, so it is divisible by 2.
What are the factors of 52002?
1, 2, 3, 6, 9, 18, 27, 54, 81, 107, 162, 214, 243, 321, 486, 642, 963, 1926, 2889, 5778, 8667, 17334, 26001, 52002.
What is 52002 in binary?
1100101100100010 (hexadecimal CB22, octal 145442).
What is the square root of 52002?
About 228.0395, exactly 9√642.
Is 52002 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 52002?
52002 is a Harshad number: divisible by its digit sum 9.