The number 20034
20034 is a composite number with 32 divisors. Its prime factorisation is 2 × × 7 × 53. Divisors (32): 1, 2, 3, 6, 7, 9, 14, 18, 21, 27, 42, 53, 54, 63, 106, 126 … 20034.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20034: a Harshad number: divisible by its digit sum 9.
- 2
20034 is composite. Its prime factorisation is
- 3
The divisors add up to 51840; without 20034 itself that is 31806, so 20034 is abundant (31806 is more than 20034). Euler's totient φ(20034) = 5616 numbers up to 20034 share no factor with it.
- 4
The digits of 20034 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 92 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20034 = 2 \times 3^{3} \times 7 \times 53 \]20034 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 51840 |
| Euler totient φ(n) | 5616 |
| Square | 401361156 |
| Cube | 8040869399304 |
| Square root | 141.541513 (= 3√2226) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 92 |
| Scientific notation | 2.0034 × |
20034 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand and thirty-four |
| Binary (base 2) | 100111001000010 |
| Octal (base 8) | 47102 |
| Hexadecimal (base 16) | 4E42 |
| Base 3 | 1000111000 |
| As time | 20034 seconds = 5 h 33 min 54 s |
Is 20034 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20034 ÷ 2 = 10017) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (20034 ÷ 3 = 6678) | 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 (20034 ÷ 6 = 3339) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (20034 ÷ 7 = 2862) | 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 | Yes (20034 ÷ 9 = 2226) | 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 3) | 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 20034 a prime number?
No. 20034 = 2 × × 7 × 53, so it is divisible by 2.
What are the factors of 20034?
1, 2, 3, 6, 7, 9, 14, 18, 21, 27, 42, 53, 54, 63, 106, 126, 159, 189, 318, 371, 378, 477, 742, 954, 1113, 1431, 2226, 2862, 3339, 6678, 10017, 20034.
What is 20034 in binary?
100111001000010 (hexadecimal 4E42, octal 47102).
What is the square root of 20034?
About 141.5415, exactly 3√2226.
Is 20034 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 20034?
20034 is a Harshad number: divisible by its digit sum 9.