The number 19812
19812 is a composite number with 24 divisors. Its prime factorisation is × 3 × 13 × 127. Divisors (24): 1, 2, 3, 4, 6, 12, 13, 26, 39, 52, 78, 127, 156, 254, 381, 508 … 19812.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19812 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19812 is composite. Its prime factorisation is
- 3
The divisors add up to 50176; without 19812 itself that is 30364, so 19812 is abundant (30364 is more than 19812). Euler's totient φ(19812) = 6048 numbers up to 19812 share no factor with it.
- 4
The digits of 19812 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 43 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19812 = 2^{2} \times 3 \times 13 \times 127 \]19812 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 50176 |
| Euler totient φ(n) | 6048 |
| Square | 392515344 |
| Cube | 7776513995328 |
| Square root | 140.755106 (= 2√4953) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 43 |
| Scientific notation | 1.9812 × |
19812 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand eight hundred and twelve |
| Binary (base 2) | 100110101100100 |
| Octal (base 8) | 46544 |
| Hexadecimal (base 16) | 4D64 |
| Base 3 | 1000011210 |
| As time | 19812 seconds = 5 h 30 min 12 s |
Is 19812 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19812 ÷ 2 = 9906) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (19812 ÷ 3 = 6604) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (19812 ÷ 4 = 4953) | 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 (19812 ÷ 6 = 3302) | 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 4) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (19812 ÷ 12 = 1651) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19812 a prime number?
No. 19812 = × 3 × 13 × 127, so it is divisible by 2.
What are the factors of 19812?
1, 2, 3, 4, 6, 12, 13, 26, 39, 52, 78, 127, 156, 254, 381, 508, 762, 1524, 1651, 3302, 4953, 6604, 9906, 19812.
What is 19812 in binary?
100110101100100 (hexadecimal 4D64, octal 46544).
What is the square root of 19812?
About 140.7551, exactly 2√4953.
Is 19812 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 19812?
It is a composite number with 24 divisors.