The number 94802
94802 is a composite number with 8 divisors. Its prime factorisation is 2 × 107 × 443. Divisors (8): 1, 2, 107, 214, 443, 886, 47401, 94802.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94802 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94802 is composite. Its prime factorisation is
- 3
The divisors add up to 143856; without 94802 itself that is 49054, so 94802 is deficient (49054 is less than 94802). Euler's totient φ(94802) = 46852 numbers up to 94802 share no factor with it.
- 4
The digits of 94802 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94802 = 2 \times 107 \times 443 \]
94802 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 143856 |
| Euler totient φ(n) | 46852 |
| Square | 8987419204 |
| Cube | 852025315377608 |
| Square root | 307.899334 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 76 |
| Scientific notation | 9.4802 × |
94802 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand eight hundred and two |
| Binary (base 2) | 10111001001010010 |
| Octal (base 8) | 271122 |
| Hexadecimal (base 16) | 17252 |
| Base 3 | 11211001012 |
| As time | 94802 seconds = 26 h 20 min 2 s |
Is 94802 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (94802 ÷ 2 = 47401) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 5) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94802 a prime number?
No. 94802 = 2 × 107 × 443, so it is divisible by 2.
What are the factors of 94802?
1, 2, 107, 214, 443, 886, 47401, 94802.
What is 94802 in binary?
10111001001010010 (hexadecimal 17252, octal 271122).
What is the square root of 94802?
About 307.8993.
Is 94802 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 94802?
It is a composite number with 8 divisors.