The number 96802
96802 is a composite number with 8 divisors. Its prime factorisation is 2 × 29 × 1669. Divisors (8): 1, 2, 29, 58, 1669, 3338, 48401, 96802.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
96802 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
96802 is composite. Its prime factorisation is
- 3
The divisors add up to 150300; without 96802 itself that is 53498, so 96802 is deficient (53498 is less than 96802). Euler's totient φ(96802) = 46704 numbers up to 96802 share no factor with it.
- 4
The digits of 96802 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96802 = 2 \times 29 \times 1669 \]
96802 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 150300 |
| Euler totient φ(n) | 46704 |
| Square | 9370627204 |
| Cube | 907095454601608 |
| Square root | 311.130198 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 71 |
| Scientific notation | 9.6802 × |
96802 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand eight hundred and two |
| Binary (base 2) | 10111101000100010 |
| Octal (base 8) | 275042 |
| Hexadecimal (base 16) | 17A22 |
| Base 3 | 11220210021 |
| As time | 96802 seconds = 26 h 53 min 22 s |
Is 96802 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (96802 ÷ 2 = 48401) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 96802 a prime number?
No. 96802 = 2 × 29 × 1669, so it is divisible by 2.
What are the factors of 96802?
1, 2, 29, 58, 1669, 3338, 48401, 96802.
What is 96802 in binary?
10111101000100010 (hexadecimal 17A22, octal 275042).
What is the square root of 96802?
About 311.1302.
Is 96802 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 96802?
It is a composite number with 8 divisors.