The number 20094
20094 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 17 × 197. Divisors (16): 1, 2, 3, 6, 17, 34, 51, 102, 197, 394, 591, 1182, 3349, 6698, 10047, 20094.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20094 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20094 is composite. Its prime factorisation is
- 3
The divisors add up to 42768; without 20094 itself that is 22674, so 20094 is abundant (22674 is more than 20094). Euler's totient φ(20094) = 6272 numbers up to 20094 share no factor with it.
- 4
The digits of 20094 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 92 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20094 = 2 \times 3 \times 17 \times 197 \]
20094 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 42768 |
| Euler totient φ(n) | 6272 |
| Square | 403768836 |
| Cube | 8113330990584 |
| Square root | 141.753307 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 92 |
| Scientific notation | 2.0094 × |
20094 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand and ninety-four |
| Binary (base 2) | 100111001111110 |
| Octal (base 8) | 47176 |
| Hexadecimal (base 16) | 4E7E |
| Base 3 | 1000120020 |
| As time | 20094 seconds = 5 h 34 min 54 s |
Is 20094 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20094 ÷ 2 = 10047) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (20094 ÷ 3 = 6698) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (20094 ÷ 6 = 3349) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20094 a prime number?
No. 20094 = 2 × 3 × 17 × 197, so it is divisible by 2.
What are the factors of 20094?
1, 2, 3, 6, 17, 34, 51, 102, 197, 394, 591, 1182, 3349, 6698, 10047, 20094.
What is 20094 in binary?
100111001111110 (hexadecimal 4E7E, octal 47176).
What is the square root of 20094?
About 141.7533.
Is 20094 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 20094?
It is a composite number with 16 divisors.