The number 96831
96831 is a composite number with 24 divisors. Its prime factorisation is × 7 × 29 × 53. Divisors (24): 1, 3, 7, 9, 21, 29, 53, 63, 87, 159, 203, 261, 371, 477, 609, 1113 … 96831.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
96831 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
96831 is composite. Its prime factorisation is
- 3
The divisors add up to 168480; without 96831 itself that is 71649, so 96831 is deficient (71649 is less than 96831). Euler's totient φ(96831) = 52416 numbers up to 96831 share no factor with it.
- 4
The digits of 96831 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
\[ 96831 = 3^{2} \times 7 \times 29 \times 53 \]96831 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 168480 |
| Euler totient φ(n) | 52416 |
| Square | 9376242561 |
| Cube | 907910943424191 |
| Square root | 311.176799 (= 3√10759) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 190 |
| Scientific notation | 9.6831 × |
96831 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand eight hundred and thirty-one |
| Binary (base 2) | 10111101000111111 |
| Octal (base 8) | 275077 |
| Hexadecimal (base 16) | 17A3F |
| Base 3 | 11220211100 |
| As time | 96831 seconds = 26 h 53 min 51 s |
Is 96831 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 (96831 ÷ 3 = 32277) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 | Yes (96831 ÷ 7 = 13833) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (96831 ÷ 9 = 10759) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 96831 a prime number?
No. 96831 = × 7 × 29 × 53, so it is divisible by 3.
What are the factors of 96831?
1, 3, 7, 9, 21, 29, 53, 63, 87, 159, 203, 261, 371, 477, 609, 1113, 1537, 1827, 3339, 4611, 10759, 13833, 32277, 96831.
What is 96831 in binary?
10111101000111111 (hexadecimal 17A3F, octal 275077).
What is the square root of 96831?
About 311.1768, exactly 3√10759.
Is 96831 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 96831?
It is a composite number with 24 divisors.