The number 82064
82064 is a composite number with 20 divisors. Its prime factorisation is × 23 × 223. Divisors (20): 1, 2, 4, 8, 16, 23, 46, 92, 184, 223, 368, 446, 892, 1784, 3568, 5129 … 82064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
82064 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
82064 is composite. Its prime factorisation is
- 3
The divisors add up to 166656; without 82064 itself that is 84592, so 82064 is abundant (84592 is more than 82064). Euler's totient φ(82064) = 39072 numbers up to 82064 share no factor with it.
- 4
The digits of 82064 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 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 82064 = 2^{4} \times 23 \times 223 \]82064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 166656 |
| Euler totient φ(n) | 39072 |
| Square | 6734500096 |
| Cube | 552660015878144 |
| Square root | 286.468148 (= 4√5129) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.2064 × |
82064 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand and sixty-four |
| Binary (base 2) | 10100000010010000 |
| Octal (base 8) | 240220 |
| Hexadecimal (base 16) | 14090 |
| Base 3 | 11011120102 |
| As time | 82064 seconds = 22 h 47 min 44 s |
Is 82064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (82064 ÷ 2 = 41032) | 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 (82064 ÷ 4 = 20516) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 (82064 ÷ 8 = 10258) | 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 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 82064 a prime number?
No. 82064 = × 23 × 223, so it is divisible by 2.
What are the factors of 82064?
1, 2, 4, 8, 16, 23, 46, 92, 184, 223, 368, 446, 892, 1784, 3568, 5129, 10258, 20516, 41032, 82064.
What is 82064 in binary?
10100000010010000 (hexadecimal 14090, octal 240220).
What is the square root of 82064?
About 286.4681, exactly 4√5129.
Is 82064 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 82064?
It is a composite number with 20 divisors.