The number 85959
85959 is a composite number with 6 divisors. Its prime factorisation is × 9551. Divisors (6): 1, 3, 9, 9551, 28653, 85959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
85959 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
85959 is composite. Its prime factorisation is
- 3
The divisors add up to 124176; without 85959 itself that is 38217, so 85959 is deficient (38217 is less than 85959). Euler's totient φ(85959) = 57300 numbers up to 85959 share no factor with it.
- 4
The digits of 85959 add up to 36, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85959 = 3^{2} \times 9551 \]85959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 124176 |
| Euler totient φ(n) | 57300 |
| Square | 7388949681 |
| Cube | 635146725629079 |
| Square root | 293.187653 (= 3√9551) |
| Digit sum / digital root | 36 / 9 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.5959 × |
85959 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand nine hundred and fifty-nine |
| Binary (base 2) | 10100111111000111 |
| Octal (base 8) | 247707 |
| Hexadecimal (base 16) | 14FC7 |
| Base 3 | 11100220200 |
| As time | 85959 seconds = 23 h 52 min 39 s |
Is 85959 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 (85959 ÷ 3 = 28653) | 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 | No (remainder 4) | 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 6) | 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 | Yes (85959 ÷ 9 = 9551) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 85959 a prime number?
No. 85959 = × 9551, so it is divisible by 3.
What are the factors of 85959?
1, 3, 9, 9551, 28653, 85959.
What is 85959 in binary?
10100111111000111 (hexadecimal 14FC7, octal 247707).
What is the square root of 85959?
About 293.1877, exactly 3√9551.
Is 85959 divisible by 3?
Yes. Its digits add up to 36, a multiple of 3.
What is special about the number 85959?
It is a composite number with 6 divisors.