The number 19602
19602 is a composite number with 30 divisors. Its prime factorisation is 2 × × . Divisors (30): 1, 2, 3, 6, 9, 11, 18, 22, 27, 33, 54, 66, 81, 99, 121, 162 … 19602.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19602: a Harshad number: divisible by its digit sum 18.
- 2
19602 is composite. Its prime factorisation is
- 3
The divisors add up to 48279; without 19602 itself that is 28677, so 19602 is abundant (28677 is more than 19602). Euler's totient φ(19602) = 5940 numbers up to 19602 share no factor with it.
- 4
The digits of 19602 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 105 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19602 = 2 \times 3^{4} \times 11^{2} \]19602 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 30 |
| Sum of divisors | 48279 |
| Euler totient φ(n) | 5940 |
| Square | 384238404 |
| Cube | 7531841195208 |
| Square root | 140.007143 (= 99√2) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 105 |
| Scientific notation | 1.9602 × |
19602 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and two |
| Binary (base 2) | 100110010010010 |
| Octal (base 8) | 46222 |
| Hexadecimal (base 16) | 4C92 |
| Base 3 | 222220000 |
| As time | 19602 seconds = 5 h 26 min 42 s |
Is 19602 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19602 ÷ 2 = 9801) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (19602 ÷ 3 = 6534) | 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 | Yes (19602 ÷ 6 = 3267) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (19602 ÷ 9 = 2178) | 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 | Yes (19602 ÷ 11 = 1782) | 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 19602 a prime number?
No. 19602 = 2 × × , so it is divisible by 2.
What are the factors of 19602?
1, 2, 3, 6, 9, 11, 18, 22, 27, 33, 54, 66, 81, 99, 121, 162, 198, 242, 297, 363, 594, 726, 891, 1089, 1782, 2178, 3267, 6534, 9801, 19602.
What is 19602 in binary?
100110010010010 (hexadecimal 4C92, octal 46222).
What is the square root of 19602?
About 140.0071, exactly 99√2.
Is 19602 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 19602?
19602 is a Harshad number: divisible by its digit sum 18.