The number 85941
85941 is a composite number with 10 divisors. Its prime factorisation is × 1061. Divisors (10): 1, 3, 9, 27, 81, 1061, 3183, 9549, 28647, 85941.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 85941: a Harshad number: divisible by its digit sum 27.
- 2
85941 is composite. Its prime factorisation is
- 3
The divisors add up to 128502; without 85941 itself that is 42561, so 85941 is deficient (42561 is less than 85941). Euler's totient φ(85941) = 57240 numbers up to 85941 share no factor with it.
- 4
The digits of 85941 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85941 = 3^{4} \times 1061 \]85941 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 128502 |
| Euler totient φ(n) | 57240 |
| Square | 7385855481 |
| Cube | 634747805892621 |
| Square root | 293.156955 (= 9√1061) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 133 |
| Scientific notation | 8.5941 × |
85941 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand nine hundred and forty-one |
| Binary (base 2) | 10100111110110101 |
| Octal (base 8) | 247665 |
| Hexadecimal (base 16) | 14FB5 |
| Base 3 | 11100220000 |
| As time | 85941 seconds = 23 h 52 min 21 s |
Is 85941 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 (85941 ÷ 3 = 28647) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (85941 ÷ 9 = 9549) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 85941 a prime number?
No. 85941 = × 1061, so it is divisible by 3.
What are the factors of 85941?
1, 3, 9, 27, 81, 1061, 3183, 9549, 28647, 85941.
What is 85941 in binary?
10100111110110101 (hexadecimal 14FB5, octal 247665).
What is the square root of 85941?
About 293.1570, exactly 9√1061.
Is 85941 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 85941?
85941 is a Harshad number: divisible by its digit sum 27.