The number 96141
96141 is a triangular number: 1 + 2 + … + 438 = 96141. Its prime factorisation is 3 × 73 × 439. Divisors (8): 1, 3, 73, 219, 439, 1317, 32047, 96141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 96141: a triangular number: 1 + 2 + … + 438 = 96141.
- 2
96141 is composite. Its prime factorisation is
- 3
The divisors add up to 130240; without 96141 itself that is 34099, so 96141 is deficient (34099 is less than 96141). Euler's totient φ(96141) = 63072 numbers up to 96141 share no factor with it.
- 4
The digits of 96141 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96141 = 3 \times 73 \times 439 \]
96141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 130240 |
| Euler totient φ(n) | 63072 |
| Square | 9243091881 |
| Cube | 888640096531221 |
| Square root | 310.066122 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.6141 × |
96141 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand one hundred and forty-one |
| Binary (base 2) | 10111011110001101 |
| Octal (base 8) | 273615 |
| Hexadecimal (base 16) | 1778D |
| Base 3 | 11212212210 |
| As time | 96141 seconds = 26 h 42 min 21 s |
Is 96141 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 (96141 ÷ 3 = 32047) | 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 3) | 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 | No (remainder 3) | 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 1) | 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 96141 a prime number?
No. 96141 = 3 × 73 × 439, so it is divisible by 3.
What are the factors of 96141?
1, 3, 73, 219, 439, 1317, 32047, 96141.
What is 96141 in binary?
10111011110001101 (hexadecimal 1778D, octal 273615).
What is the square root of 96141?
About 310.0661.
Is 96141 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 96141?
96141 is a triangular number: 1 + 2 + … + 438 = 96141.