The number 82485
82485 is a composite number with 32 divisors. Its prime factorisation is × 5 × 13 × 47. Divisors (32): 1, 3, 5, 9, 13, 15, 27, 39, 45, 47, 65, 117, 135, 141, 195, 235 … 82485.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 82485: a Harshad number: divisible by its digit sum 27.
- 2
82485 is composite. Its prime factorisation is
- 3
The divisors add up to 161280; without 82485 itself that is 78795, so 82485 is deficient (78795 is less than 82485). Euler's totient φ(82485) = 39744 numbers up to 82485 share no factor with it.
- 4
The digits of 82485 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 82485 = 3^{3} \times 5 \times 13 \times 47 \]82485 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 161280 |
| Euler totient φ(n) | 39744 |
| Square | 6803775225 |
| Cube | 561209399434125 |
| Square root | 287.202019 (= 3√9165) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 32 |
| Scientific notation | 8.2485 × |
82485 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand four hundred and eighty-five |
| Binary (base 2) | 10100001000110101 |
| Octal (base 8) | 241065 |
| Hexadecimal (base 16) | 14235 |
| Base 3 | 11012011000 |
| As time | 82485 seconds = 22 h 54 min 45 s |
Is 82485 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (82485 ÷ 3 = 27495) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (82485 ÷ 5 = 16497) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | No (remainder 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (82485 ÷ 9 = 9165) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 82485 a prime number?
No. 82485 = × 5 × 13 × 47, so it is divisible by 3.
What are the factors of 82485?
1, 3, 5, 9, 13, 15, 27, 39, 45, 47, 65, 117, 135, 141, 195, 235, 351, 423, 585, 611, 705, 1269, 1755, 1833, 2115, 3055, 5499, 6345, 9165, 16497, 27495, 82485.
What is 82485 in binary?
10100001000110101 (hexadecimal 14235, octal 241065).
What is the square root of 82485?
About 287.2020, exactly 3√9165.
Is 82485 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 82485?
82485 is a Harshad number: divisible by its digit sum 27.