The number 85565
85565 is a composite number with 8 divisors. Its prime factorisation is 5 × 109 × 157. Divisors (8): 1, 5, 109, 157, 545, 785, 17113, 85565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
85565 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
85565 is composite. Its prime factorisation is
- 3
The divisors add up to 104280; without 85565 itself that is 18715, so 85565 is deficient (18715 is less than 85565). Euler's totient φ(85565) = 67392 numbers up to 85565 share no factor with it.
- 4
The digits of 85565 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 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85565 = 5 \times 109 \times 157 \]
85565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 104280 |
| Euler totient φ(n) | 67392 |
| Square | 7321369225 |
| Cube | 626452957737125 |
| Square root | 292.514957 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.5565 × |
85565 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand five hundred and sixty-five |
| Binary (base 2) | 10100111000111101 |
| Octal (base 8) | 247075 |
| Hexadecimal (base 16) | 14E3D |
| Base 3 | 11100101002 |
| As time | 85565 seconds = 23 h 46 min 5 s |
Is 85565 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 (85565 ÷ 5 = 17113) | 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 | 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 | No (remainder 2) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 85565 a prime number?
No. 85565 = 5 × 109 × 157, so it is divisible by 5.
What are the factors of 85565?
1, 5, 109, 157, 545, 785, 17113, 85565.
What is 85565 in binary?
10100111000111101 (hexadecimal 14E3D, octal 247075).
What is the square root of 85565?
About 292.5150.
Is 85565 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 85565?
It is a composite number with 8 divisors.