The number 95841
95841 is a composite number with 12 divisors. Its prime factorisation is × 23 × 463. Divisors (12): 1, 3, 9, 23, 69, 207, 463, 1389, 4167, 10649, 31947, 95841.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
95841 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
95841 is composite. Its prime factorisation is
- 3
The divisors add up to 144768; without 95841 itself that is 48927, so 95841 is deficient (48927 is less than 95841). Euler's totient φ(95841) = 60984 numbers up to 95841 share no factor with it.
- 4
The digits of 95841 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 190 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95841 = 3^{2} \times 23 \times 463 \]95841 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 144768 |
| Euler totient φ(n) | 60984 |
| Square | 9185497281 |
| Cube | 880347244908321 |
| Square root | 309.581976 (= 3√10649) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 190 |
| Scientific notation | 9.5841 × |
95841 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand eight hundred and forty-one |
| Binary (base 2) | 10111011001100001 |
| Octal (base 8) | 273141 |
| Hexadecimal (base 16) | 17661 |
| Base 3 | 11212110200 |
| As time | 95841 seconds = 26 h 37 min 21 s |
Is 95841 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 (95841 ÷ 3 = 31947) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (95841 ÷ 9 = 10649) | 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 95841 a prime number?
No. 95841 = × 23 × 463, so it is divisible by 3.
What are the factors of 95841?
1, 3, 9, 23, 69, 207, 463, 1389, 4167, 10649, 31947, 95841.
What is 95841 in binary?
10111011001100001 (hexadecimal 17661, octal 273141).
What is the square root of 95841?
About 309.5820, exactly 3√10649.
Is 95841 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 95841?
It is a composite number with 12 divisors.