The number 94809
94809 is a composite number with 24 divisors. Its prime factorisation is 3 × 11 × × 17. Divisors (24): 1, 3, 11, 13, 17, 33, 39, 51, 143, 169, 187, 221, 429, 507, 561, 663 … 94809.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94809 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94809 is composite. Its prime factorisation is
- 3
The divisors add up to 158112; without 94809 itself that is 63303, so 94809 is deficient (63303 is less than 94809). Euler's totient φ(94809) = 49920 numbers up to 94809 share no factor with it.
- 4
The digits of 94809 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 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94809 = 3 \times 11 \times 13^{2} \times 17 \]94809 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 158112 |
| Euler totient φ(n) | 49920 |
| Square | 8988746481 |
| Cube | 852214065117129 |
| Square root | 307.910701 (= 13√561) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 76 |
| Scientific notation | 9.4809 × |
94809 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand eight hundred and nine |
| Binary (base 2) | 10111001001011001 |
| Octal (base 8) | 271131 |
| Hexadecimal (base 16) | 17259 |
| Base 3 | 11211001110 |
| As time | 94809 seconds = 26 h 20 min 9 s |
Is 94809 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 (94809 ÷ 3 = 31603) | 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 4) | 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 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 1) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (94809 ÷ 11 = 8619) | 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 94809 a prime number?
No. 94809 = 3 × 11 × × 17, so it is divisible by 3.
What are the factors of 94809?
1, 3, 11, 13, 17, 33, 39, 51, 143, 169, 187, 221, 429, 507, 561, 663, 1859, 2431, 2873, 5577, 7293, 8619, 31603, 94809.
What is 94809 in binary?
10111001001011001 (hexadecimal 17259, octal 271131).
What is the square root of 94809?
About 307.9107, exactly 13√561.
Is 94809 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 94809?
It is a composite number with 24 divisors.