The number 85964
85964 is a composite number with 6 divisors. Its prime factorisation is × 21491. Divisors (6): 1, 2, 4, 21491, 42982, 85964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
85964 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
85964 is composite. Its prime factorisation is
- 3
The divisors add up to 150444; without 85964 itself that is 64480, so 85964 is deficient (64480 is less than 85964). Euler's totient φ(85964) = 42980 numbers up to 85964 share no factor with it.
- 4
The digits of 85964 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85964 = 2^{2} \times 21491 \]85964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 150444 |
| Euler totient φ(n) | 42980 |
| Square | 7389809296 |
| Cube | 635257566321344 |
| Square root | 293.196180 (= 2√21491) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 58 |
| Scientific notation | 8.5964 × |
85964 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand nine hundred and sixty-four |
| Binary (base 2) | 10100111111001100 |
| Octal (base 8) | 247714 |
| Hexadecimal (base 16) | 14FCC |
| Base 3 | 11100220212 |
| As time | 85964 seconds = 23 h 52 min 44 s |
Is 85964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (85964 ÷ 2 = 42982) | 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 | Yes (85964 ÷ 4 = 21491) | 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 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 85964 a prime number?
No. 85964 = × 21491, so it is divisible by 2.
What are the factors of 85964?
1, 2, 4, 21491, 42982, 85964.
What is 85964 in binary?
10100111111001100 (hexadecimal 14FCC, octal 247714).
What is the square root of 85964?
About 293.1962, exactly 2√21491.
Is 85964 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 85964?
It is a composite number with 6 divisors.