The number 96813
96813 is a composite number with 12 divisors. Its prime factorisation is × 31 × 347. Divisors (12): 1, 3, 9, 31, 93, 279, 347, 1041, 3123, 10757, 32271, 96813.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
96813 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
96813 is composite. Its prime factorisation is
- 3
The divisors add up to 144768; without 96813 itself that is 47955, so 96813 is deficient (47955 is less than 96813). Euler's totient φ(96813) = 62280 numbers up to 96813 share no factor with it.
- 4
The digits of 96813 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 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96813 = 3^{2} \times 31 \times 347 \]96813 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 144768 |
| Euler totient φ(n) | 62280 |
| Square | 9372756969 |
| Cube | 907404720439797 |
| Square root | 311.147875 (= 3√10757) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 71 |
| Scientific notation | 9.6813 × |
96813 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand eight hundred and thirteen |
| Binary (base 2) | 10111101000101101 |
| Octal (base 8) | 275055 |
| Hexadecimal (base 16) | 17A2D |
| Base 3 | 11220210200 |
| As time | 96813 seconds = 26 h 53 min 33 s |
Is 96813 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 (96813 ÷ 3 = 32271) | 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 3) | 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 | Yes (96813 ÷ 9 = 10757) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 96813 a prime number?
No. 96813 = × 31 × 347, so it is divisible by 3.
What are the factors of 96813?
1, 3, 9, 31, 93, 279, 347, 1041, 3123, 10757, 32271, 96813.
What is 96813 in binary?
10111101000101101 (hexadecimal 17A2D, octal 275055).
What is the square root of 96813?
About 311.1479, exactly 3√10757.
Is 96813 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 96813?
It is a composite number with 12 divisors.