The number 94804
94804 is a composite number with 12 divisors. Its prime factorisation is × 137 × 173. Divisors (12): 1, 2, 4, 137, 173, 274, 346, 548, 692, 23701, 47402, 94804.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94804 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94804 is composite. Its prime factorisation is
- 3
The divisors add up to 168084; without 94804 itself that is 73280, so 94804 is deficient (73280 is less than 94804). Euler's totient φ(94804) = 46784 numbers up to 94804 share no factor with it.
- 4
The digits of 94804 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 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94804 = 2^{2} \times 137 \times 173 \]94804 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 168084 |
| Euler totient φ(n) | 46784 |
| Square | 8987798416 |
| Cube | 852079241030464 |
| Square root | 307.902582 (= 2√23701) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 40 |
| Scientific notation | 9.4804 × |
94804 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand eight hundred and four |
| Binary (base 2) | 10111001001010100 |
| Octal (base 8) | 271124 |
| Hexadecimal (base 16) | 17254 |
| Base 3 | 11211001021 |
| As time | 94804 seconds = 26 h 20 min 4 s |
Is 94804 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (94804 ÷ 2 = 47402) | 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 | Yes (94804 ÷ 4 = 23701) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 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 4) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94804 a prime number?
No. 94804 = × 137 × 173, so it is divisible by 2.
What are the factors of 94804?
1, 2, 4, 137, 173, 274, 346, 548, 692, 23701, 47402, 94804.
What is 94804 in binary?
10111001001010100 (hexadecimal 17254, octal 271124).
What is the square root of 94804?
About 307.9026, exactly 2√23701.
Is 94804 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 94804?
It is a composite number with 12 divisors.