The number 85961
85961 is a composite number with 4 divisors. Its prime factorisation is 67 × 1283. Divisors (4): 1, 67, 1283, 85961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 85961: a semiprime: 67 × 1283, the product of two primes.
- 2
85961 is composite. Its prime factorisation is
- 3
The divisors add up to 87312; without 85961 itself that is 1351, so 85961 is deficient (1351 is less than 85961). Euler's totient φ(85961) = 84612 numbers up to 85961 share no factor with it.
- 4
The digits of 85961 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 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85961 = 67 \times 1283 \]
85961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 87312 |
| Euler totient φ(n) | 84612 |
| Square | 7389293521 |
| Cube | 635191060358681 |
| Square root | 293.191064 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 133 |
| Scientific notation | 8.5961 × |
85961 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand nine hundred and sixty-one |
| Binary (base 2) | 10100111111001001 |
| Octal (base 8) | 247711 |
| Hexadecimal (base 16) | 14FC9 |
| Base 3 | 11100220202 |
| As time | 85961 seconds = 23 h 52 min 41 s |
Is 85961 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 | No (remainder 1) | 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 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 1) | 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 1) | 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 85961 a prime number?
No. 85961 = 67 × 1283, so it is divisible by 67.
What are the factors of 85961?
1, 67, 1283, 85961.
What is 85961 in binary?
10100111111001001 (hexadecimal 14FC9, octal 247711).
What is the square root of 85961?
About 293.1911.
Is 85961 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 85961?
85961 is a semiprime: 67 × 1283, the product of two primes.