The number 85705
85705 is a composite number with 8 divisors. Its prime factorisation is 5 × 61 × 281. Divisors (8): 1, 5, 61, 281, 305, 1405, 17141, 85705.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
85705 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
85705 is composite. Its prime factorisation is
- 3
The divisors add up to 104904; without 85705 itself that is 19199, so 85705 is deficient (19199 is less than 85705). Euler's totient φ(85705) = 67200 numbers up to 85705 share no factor with it.
- 4
The digits of 85705 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85705 = 5 \times 61 \times 281 \]
85705 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 104904 |
| Euler totient φ(n) | 67200 |
| Square | 7345347025 |
| Cube | 629532966777625 |
| Square root | 292.754163 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 102 |
| Scientific notation | 8.5705 × |
85705 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand seven hundred and five |
| Binary (base 2) | 10100111011001001 |
| Octal (base 8) | 247311 |
| Hexadecimal (base 16) | 14EC9 |
| Base 3 | 11100120021 |
| As time | 85705 seconds = 23 h 48 min 25 s |
Is 85705 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 1) | 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 (85705 ÷ 5 = 17141) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 85705 a prime number?
No. 85705 = 5 × 61 × 281, so it is divisible by 5.
What are the factors of 85705?
1, 5, 61, 281, 305, 1405, 17141, 85705.
What is 85705 in binary?
10100111011001001 (hexadecimal 14EC9, octal 247311).
What is the square root of 85705?
About 292.7542.
Is 85705 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 85705?
It is a composite number with 8 divisors.