The number 82565
82565 is a binary palindrome (10100001010000101). Its prime factorisation is 5 × × 337. Divisors (12): 1, 5, 7, 35, 49, 245, 337, 1685, 2359, 11795, 16513, 82565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 82565: a binary palindrome (10100001010000101).
- 2
82565 is composite. Its prime factorisation is
- 3
The divisors add up to 115596; without 82565 itself that is 33031, so 82565 is deficient (33031 is less than 82565). Euler's totient φ(82565) = 56448 numbers up to 82565 share no factor with it.
- 4
The digits of 82565 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 82565 = 5 \times 7^{2} \times 337 \]82565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 115596 |
| Euler totient φ(n) | 56448 |
| Square | 6816979225 |
| Cube | 562843889712125 |
| Square root | 287.341261 (= 7√1685) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.2565 × |
82565 in other forms
| Form | Value |
|---|---|
| In words | eighty-two thousand five hundred and sixty-five |
| Binary (base 2) | 10100001010000101 |
| Octal (base 8) | 241205 |
| Hexadecimal (base 16) | 14285 |
| Base 3 | 11012020222 |
| As time | 82565 seconds = 22 h 56 min 5 s |
Is 82565 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 | No (remainder 2) | 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 (82565 ÷ 5 = 16513) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (82565 ÷ 7 = 11795) | 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 | No (remainder 8) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 82565 a prime number?
No. 82565 = 5 × × 337, so it is divisible by 5.
What are the factors of 82565?
1, 5, 7, 35, 49, 245, 337, 1685, 2359, 11795, 16513, 82565.
What is 82565 in binary?
10100001010000101 (hexadecimal 14285, octal 241205).
What is the square root of 82565?
About 287.3413, exactly 7√1685.
Is 82565 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 82565?
82565 is a binary palindrome (10100001010000101).