The number 96801
96801 is a composite number with 8 divisors. Its prime factorisation is 3 × 41 × 787. Divisors (8): 1, 3, 41, 123, 787, 2361, 32267, 96801.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
96801 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
96801 is composite. Its prime factorisation is
- 3
The divisors add up to 132384; without 96801 itself that is 35583, so 96801 is deficient (35583 is less than 96801). Euler's totient φ(96801) = 62880 numbers up to 96801 share no factor with it.
- 4
The digits of 96801 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96801 = 3 \times 41 \times 787 \]
96801 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 132384 |
| Euler totient φ(n) | 62880 |
| Square | 9370433601 |
| Cube | 907067343010401 |
| Square root | 311.128591 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 97 |
| Scientific notation | 9.6801 × |
96801 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand eight hundred and one |
| Binary (base 2) | 10111101000100001 |
| Octal (base 8) | 275041 |
| Hexadecimal (base 16) | 17A21 |
| Base 3 | 11220210020 |
| As time | 96801 seconds = 26 h 53 min 21 s |
Is 96801 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 (96801 ÷ 3 = 32267) | 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 5) | 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 | No (remainder 6) | 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 96801 a prime number?
No. 96801 = 3 × 41 × 787, so it is divisible by 3.
What are the factors of 96801?
1, 3, 41, 123, 787, 2361, 32267, 96801.
What is 96801 in binary?
10111101000100001 (hexadecimal 17A21, octal 275041).
What is the square root of 96801?
About 311.1286.
Is 96801 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 96801?
It is a composite number with 8 divisors.