The number 84064
84064 is a composite number with 24 divisors. Its prime factorisation is × 37 × 71. Divisors (24): 1, 2, 4, 8, 16, 32, 37, 71, 74, 142, 148, 284, 296, 568, 592, 1136 … 84064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
84064 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
84064 is composite. Its prime factorisation is
- 3
The divisors add up to 172368; without 84064 itself that is 88304, so 84064 is abundant (88304 is more than 84064). Euler's totient φ(84064) = 40320 numbers up to 84064 share no factor with it.
- 4
The digits of 84064 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 84064 = 2^{5} \times 37 \times 71 \]84064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 172368 |
| Euler totient φ(n) | 40320 |
| Square | 7066756096 |
| Cube | 594059784454144 |
| Square root | 289.937924 (= 4√5254) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 32 |
| Scientific notation | 8.4064 × |
84064 in other forms
| Form | Value |
|---|---|
| In words | eighty-four thousand and sixty-four |
| Binary (base 2) | 10100100001100000 |
| Octal (base 8) | 244140 |
| Hexadecimal (base 16) | 14860 |
| Base 3 | 11021022111 |
| As time | 84064 seconds = 23 h 21 min 4 s |
Is 84064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (84064 ÷ 2 = 42032) | 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 (84064 ÷ 4 = 21016) | 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 | 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 (84064 ÷ 8 = 10508) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 84064 a prime number?
No. 84064 = × 37 × 71, so it is divisible by 2.
What are the factors of 84064?
1, 2, 4, 8, 16, 32, 37, 71, 74, 142, 148, 284, 296, 568, 592, 1136, 1184, 2272, 2627, 5254, 10508, 21016, 42032, 84064.
What is 84064 in binary?
10100100001100000 (hexadecimal 14860, octal 244140).
What is the square root of 84064?
About 289.9379, exactly 4√5254.
Is 84064 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 84064?
It is a composite number with 24 divisors.