The number 62064
62064 is a composite number with 30 divisors. Its prime factorisation is × × 431. Divisors (30): 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 36, 48, 72, 144, 431 … 62064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 62064: a Harshad number: divisible by its digit sum 18.
- 2
62064 is composite. Its prime factorisation is
- 3
The divisors add up to 174096; without 62064 itself that is 112032, so 62064 is abundant (112032 is more than 62064). Euler's totient φ(62064) = 20640 numbers up to 62064 share no factor with it.
- 4
The digits of 62064 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 62064 = 2^{4} \times 3^{2} \times 431 \]62064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 30 |
| Sum of divisors | 174096 |
| Euler totient φ(n) | 20640 |
| Square | 3851940096 |
| Cube | 239066810118144 |
| Square root | 249.126474 (= 12√431) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 148 |
| Scientific notation | 6.2064 × |
62064 in other forms
| Form | Value |
|---|---|
| In words | sixty-two thousand and sixty-four |
| Binary (base 2) | 1111001001110000 |
| Octal (base 8) | 171160 |
| Hexadecimal (base 16) | F270 |
| Base 3 | 10011010200 |
| As time | 62064 seconds = 17 h 14 min 24 s |
Is 62064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (62064 ÷ 2 = 31032) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (62064 ÷ 3 = 20688) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (62064 ÷ 4 = 15516) | 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 (62064 ÷ 6 = 10344) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (62064 ÷ 8 = 7758) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (62064 ÷ 9 = 6896) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (62064 ÷ 12 = 5172) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 62064 a prime number?
No. 62064 = × × 431, so it is divisible by 2.
What are the factors of 62064?
1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 36, 48, 72, 144, 431, 862, 1293, 1724, 2586, 3448, 3879, 5172, 6896, 7758, 10344, 15516, 20688, 31032, 62064.
What is 62064 in binary?
1111001001110000 (hexadecimal F270, octal 171160).
What is the square root of 62064?
About 249.1265, exactly 12√431.
Is 62064 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 62064?
62064 is a Harshad number: divisible by its digit sum 18.