The number 82496
82496 is a composite number with 14 divisors. Its prime factorisation is × 1289. Divisors (14): 1, 2, 4, 8, 16, 32, 64, 1289, 2578, 5156, 10312, 20624, 41248, 82496.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
82496 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
82496 is composite. Its prime factorisation is
- 3
The divisors add up to 163830; without 82496 itself that is 81334, so 82496 is deficient (81334 is less than 82496). Euler's totient φ(82496) = 41216 numbers up to 82496 share no factor with it.
- 4
The digits of 82496 add up to 29, 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
\[ 82496 = 2^{6} \times 1289 \]82496 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 14 |
| Sum of divisors | 163830 |
| Euler totient φ(n) | 41216 |
| Square | 6805590016 |
| Cube | 561433953959936 |
| Square root | 287.221169 (= 8√1289) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.2496 × |
82496 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand four hundred and ninety-six |
| Binary (base 2) | 10100001001000000 |
| Octal (base 8) | 241100 |
| Hexadecimal (base 16) | 14240 |
| Base 3 | 11012011102 |
| As time | 82496 seconds = 22 h 54 min 56 s |
Is 82496 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (82496 ÷ 2 = 41248) | 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 (82496 ÷ 4 = 20624) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 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 (82496 ÷ 8 = 10312) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 82496 a prime number?
No. 82496 = × 1289, so it is divisible by 2.
What are the factors of 82496?
1, 2, 4, 8, 16, 32, 64, 1289, 2578, 5156, 10312, 20624, 41248, 82496.
What is 82496 in binary?
10100001001000000 (hexadecimal 14240, octal 241100).
What is the square root of 82496?
About 287.2212, exactly 8√1289.
Is 82496 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 82496?
It is a composite number with 14 divisors.