The number 85695
85695 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 29 × 197. Divisors (16): 1, 3, 5, 15, 29, 87, 145, 197, 435, 591, 985, 2955, 5713, 17139, 28565, 85695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
85695 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
85695 is composite. Its prime factorisation is
- 3
The divisors add up to 142560; without 85695 itself that is 56865, so 85695 is deficient (56865 is less than 85695). Euler's totient φ(85695) = 43904 numbers up to 85695 share no factor with it.
- 4
The digits of 85695 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 195 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85695 = 3 \times 5 \times 29 \times 197 \]
85695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 142560 |
| Euler totient φ(n) | 43904 |
| Square | 7343633025 |
| Cube | 629312632077375 |
| Square root | 292.737083 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 195 |
| Scientific notation | 8.5695 × |
85695 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand six hundred and ninety-five |
| Binary (base 2) | 10100111010111111 |
| Octal (base 8) | 247277 |
| Hexadecimal (base 16) | 14EBF |
| Base 3 | 11100112220 |
| As time | 85695 seconds = 23 h 48 min 15 s |
Is 85695 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 (85695 ÷ 3 = 28565) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (85695 ÷ 5 = 17139) | 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 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 | No (remainder 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 85695 a prime number?
No. 85695 = 3 × 5 × 29 × 197, so it is divisible by 3.
What are the factors of 85695?
1, 3, 5, 15, 29, 87, 145, 197, 435, 591, 985, 2955, 5713, 17139, 28565, 85695.
What is 85695 in binary?
10100111010111111 (hexadecimal 14EBF, octal 247277).
What is the square root of 85695?
About 292.7371.
Is 85695 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 85695?
It is a composite number with 16 divisors.