The number 85952
85952 is a composite number with 28 divisors. Its prime factorisation is × 17 × 79. Divisors (28): 1, 2, 4, 8, 16, 17, 32, 34, 64, 68, 79, 136, 158, 272, 316, 544 … 85952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
85952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
85952 is composite. Its prime factorisation is
- 3
The divisors add up to 182880; without 85952 itself that is 96928, so 85952 is abundant (96928 is more than 85952). Euler's totient φ(85952) = 39936 numbers up to 85952 share no factor with it.
- 4
The digits of 85952 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 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85952 = 2^{6} \times 17 \times 79 \]85952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 28 |
| Sum of divisors | 182880 |
| Euler totient φ(n) | 39936 |
| Square | 7387746304 |
| Cube | 634991570321408 |
| Square root | 293.175715 (= 8√1343) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 102 |
| Scientific notation | 8.5952 × |
85952 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand nine hundred and fifty-two |
| Binary (base 2) | 10100111111000000 |
| Octal (base 8) | 247700 |
| Hexadecimal (base 16) | 14FC0 |
| Base 3 | 11100220102 |
| As time | 85952 seconds = 23 h 52 min 32 s |
Is 85952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (85952 ÷ 2 = 42976) | 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 (85952 ÷ 4 = 21488) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 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 | Yes (85952 ÷ 8 = 10744) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 85952 a prime number?
No. 85952 = × 17 × 79, so it is divisible by 2.
What are the factors of 85952?
1, 2, 4, 8, 16, 17, 32, 34, 64, 68, 79, 136, 158, 272, 316, 544, 632, 1088, 1264, 1343, 2528, 2686, 5056, 5372, 10744, 21488, 42976, 85952.
What is 85952 in binary?
10100111111000000 (hexadecimal 14FC0, octal 247700).
What is the square root of 85952?
About 293.1757, exactly 8√1343.
Is 85952 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 85952?
It is a composite number with 28 divisors.