The number 96807
96807 is a composite number with 12 divisors. Its prime factorisation is 3 × × 61. Divisors (12): 1, 3, 23, 61, 69, 183, 529, 1403, 1587, 4209, 32269, 96807.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 96807: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
96807 is composite. Its prime factorisation is
- 3
The divisors add up to 137144; without 96807 itself that is 40337, so 96807 is deficient (40337 is less than 96807). Euler's totient φ(96807) = 60720 numbers up to 96807 share no factor with it.
- 4
The digits of 96807 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96807 = 3 \times 23^{2} \times 61 \]96807 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 137144 |
| Euler totient φ(n) | 60720 |
| Square | 9371595249 |
| Cube | 907236021269943 |
| Square root | 311.138233 (= 23√183) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 97 |
| Scientific notation | 9.6807 × |
96807 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand eight hundred and seven |
| Binary (base 2) | 10111101000100111 |
| Octal (base 8) | 275047 |
| Hexadecimal (base 16) | 17A27 |
| Base 3 | 11220210110 |
| As time | 96807 seconds = 26 h 53 min 27 s |
Is 96807 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 (96807 ÷ 3 = 32269) | 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 2) | 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 7) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 96807 a prime number?
No. 96807 = 3 × × 61, so it is divisible by 3.
What are the factors of 96807?
1, 3, 23, 61, 69, 183, 529, 1403, 1587, 4209, 32269, 96807.
What is 96807 in binary?
10111101000100111 (hexadecimal 17A27, octal 275047).
What is the square root of 96807?
About 311.1382, exactly 23√183.
Is 96807 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 96807?
96807 is a happy number: repeatedly adding the squares of its digits reaches 1.