The number 52480
52480 is a composite number with 36 divisors. Its prime factorisation is × 5 × 41. Divisors (36): 1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 41, 64, 80, 82, 128, 160 … 52480.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52480: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
52480 is composite. Its prime factorisation is
- 3
The divisors add up to 128772; without 52480 itself that is 76292, so 52480 is abundant (76292 is more than 52480). Euler's totient φ(52480) = 20480 numbers up to 52480 share no factor with it.
- 4
The digits of 52480 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52480 = 2^{8} \times 5 \times 41 \]52480 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 128772 |
| Euler totient φ(n) | 20480 |
| Square | 2754150400 |
| Cube | 144537812992000 |
| Square root | 229.085137 (= 16√205) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 34 |
| Scientific notation | 5.248 × |
52480 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand four hundred and eighty |
| Binary (base 2) | 1100110100000000 |
| Octal (base 8) | 146400 |
| Hexadecimal (base 16) | CD00 |
| Base 3 | 2122222201 |
| As time | 52480 seconds = 14 h 34 min 40 s |
Is 52480 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52480 ÷ 2 = 26240) | 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 | Yes (52480 ÷ 4 = 13120) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (52480 ÷ 5 = 10496) | 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 1) | 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 | Yes (52480 ÷ 8 = 6560) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (52480 ÷ 10 = 5248) | 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 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52480 a prime number?
No. 52480 = × 5 × 41, so it is divisible by 2.
What are the factors of 52480?
1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 41, 64, 80, 82, 128, 160, 164, 205, 256, 320, 328, 410, 640, 656, 820, 1280, 1312, 1640, 2624, 3280, 5248, 6560, 10496, 13120, 26240, 52480.
What is 52480 in binary?
1100110100000000 (hexadecimal CD00, octal 146400).
What is the square root of 52480?
About 229.0851, exactly 16√205.
Is 52480 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 52480?
52480 is a happy number: repeatedly adding the squares of its digits reaches 1.