The number 85951
85951 is a composite number with 8 divisors. Its prime factorisation is 23 × 37 × 101. Divisors (8): 1, 23, 37, 101, 851, 2323, 3737, 85951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
85951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
85951 is composite. Its prime factorisation is
- 3
The divisors add up to 93024; without 85951 itself that is 7073, so 85951 is deficient (7073 is less than 85951). Euler's totient φ(85951) = 79200 numbers up to 85951 share no factor with it.
- 4
The digits of 85951 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 195 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85951 = 23 \times 37 \times 101 \]
85951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 93024 |
| Euler totient φ(n) | 79200 |
| Square | 7387574401 |
| Cube | 634969407340351 |
| Square root | 293.174010 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 195 |
| Scientific notation | 8.5951 × |
85951 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand nine hundred and fifty-one |
| Binary (base 2) | 10100111110111111 |
| Octal (base 8) | 247677 |
| Hexadecimal (base 16) | 14FBF |
| Base 3 | 11100220101 |
| As time | 85951 seconds = 23 h 52 min 31 s |
Is 85951 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 5) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 85951 a prime number?
No. 85951 = 23 × 37 × 101, so it is divisible by 23.
What are the factors of 85951?
1, 23, 37, 101, 851, 2323, 3737, 85951.
What is 85951 in binary?
10100111110111111 (hexadecimal 14FBF, octal 247677).
What is the square root of 85951?
About 293.1740.
Is 85951 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 85951?
It is a composite number with 8 divisors.