The number 19818
19818 is a composite number with 16 divisors. Its prime factorisation is 2 × × 367. Divisors (16): 1, 2, 3, 6, 9, 18, 27, 54, 367, 734, 1101, 2202, 3303, 6606, 9909, 19818.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19818: a Harshad number: divisible by its digit sum 27.
- 2
19818 is composite. Its prime factorisation is
- 3
The divisors add up to 44160; without 19818 itself that is 24342, so 19818 is abundant (24342 is more than 19818). Euler's totient φ(19818) = 6588 numbers up to 19818 share no factor with it.
- 4
The digits of 19818 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 136 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19818 = 2 \times 3^{3} \times 367 \]19818 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 44160 |
| Euler totient φ(n) | 6588 |
| Square | 392753124 |
| Cube | 7783581411432 |
| Square root | 140.776418 (= 3√2202) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 136 |
| Scientific notation | 1.9818 × |
19818 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand eight hundred and eighteen |
| Binary (base 2) | 100110101101010 |
| Octal (base 8) | 46552 |
| Hexadecimal (base 16) | 4D6A |
| Base 3 | 1000012000 |
| As time | 19818 seconds = 5 h 30 min 18 s |
Is 19818 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19818 ÷ 2 = 9909) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (19818 ÷ 3 = 6606) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (19818 ÷ 6 = 3303) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (19818 ÷ 9 = 2202) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 19818 a prime number?
No. 19818 = 2 × × 367, so it is divisible by 2.
What are the factors of 19818?
1, 2, 3, 6, 9, 18, 27, 54, 367, 734, 1101, 2202, 3303, 6606, 9909, 19818.
What is 19818 in binary?
100110101101010 (hexadecimal 4D6A, octal 46552).
What is the square root of 19818?
About 140.7764, exactly 3√2202.
Is 19818 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 19818?
19818 is a Harshad number: divisible by its digit sum 27.