The number 62480
62480 is a composite number with 40 divisors. Its prime factorisation is × 5 × 11 × 71. Divisors (40): 1, 2, 4, 5, 8, 10, 11, 16, 20, 22, 40, 44, 55, 71, 80, 88 … 62480.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 62480: a Harshad number: divisible by its digit sum 20.
- 2
62480 is composite. Its prime factorisation is
- 3
The divisors add up to 160704; without 62480 itself that is 98224, so 62480 is abundant (98224 is more than 62480). Euler's totient φ(62480) = 22400 numbers up to 62480 share no factor with it.
- 4
The digits of 62480 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 62480 = 2^{4} \times 5 \times 11 \times 71 \]62480 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 160704 |
| Euler totient φ(n) | 22400 |
| Square | 3903750400 |
| Cube | 243906324992000 |
| Square root | 249.959997 (= 4√3905) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 104 |
| Scientific notation | 6.248 × |
62480 in other forms
| Form | Value |
|---|---|
| In words | sixty-two thousand four hundred and eighty |
| Binary (base 2) | 1111010000010000 |
| Octal (base 8) | 172020 |
| Hexadecimal (base 16) | F410 |
| Base 3 | 10011201002 |
| As time | 62480 seconds = 17 h 21 min 20 s |
Is 62480 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (62480 ÷ 2 = 31240) | 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 | Yes (62480 ÷ 4 = 15620) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (62480 ÷ 5 = 12496) | 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 5) | 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 (62480 ÷ 8 = 7810) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (62480 ÷ 10 = 6248) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (62480 ÷ 11 = 5680) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 62480 a prime number?
No. 62480 = × 5 × 11 × 71, so it is divisible by 2.
What are the factors of 62480?
1, 2, 4, 5, 8, 10, 11, 16, 20, 22, 40, 44, 55, 71, 80, 88, 110, 142, 176, 220, 284, 355, 440, 568, 710, 781, 880, 1136, 1420, 1562, 2840, 3124, 3905, 5680, 6248, 7810, 12496, 15620, 31240, 62480.
What is 62480 in binary?
1111010000010000 (hexadecimal F410, octal 172020).
What is the square root of 62480?
About 249.9600, exactly 4√3905.
Is 62480 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 62480?
62480 is a Harshad number: divisible by its digit sum 20.