The number 19810
19810 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 7 × 283. Divisors (16): 1, 2, 5, 7, 10, 14, 35, 70, 283, 566, 1415, 1981, 2830, 3962, 9905, 19810.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19810 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19810 is composite. Its prime factorisation is
- 3
The divisors add up to 40896; without 19810 itself that is 21086, so 19810 is abundant (21086 is more than 19810). Euler's totient φ(19810) = 6768 numbers up to 19810 share no factor with it.
- 4
The digits of 19810 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 43 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19810 = 2 \times 5 \times 7 \times 283 \]
19810 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 40896 |
| Euler totient φ(n) | 6768 |
| Square | 392436100 |
| Cube | 7774159141000 |
| Square root | 140.748002 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 43 |
| Scientific notation | 1.981 × |
19810 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand eight hundred and ten |
| Binary (base 2) | 100110101100010 |
| Octal (base 8) | 46542 |
| Hexadecimal (base 16) | 4D62 |
| Base 3 | 1000011201 |
| As time | 19810 seconds = 5 h 30 min 10 s |
Is 19810 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19810 ÷ 2 = 9905) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 | Yes (19810 ÷ 5 = 3962) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (19810 ÷ 7 = 2830) | 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 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (19810 ÷ 10 = 1981) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19810 a prime number?
No. 19810 = 2 × 5 × 7 × 283, so it is divisible by 2.
What are the factors of 19810?
1, 2, 5, 7, 10, 14, 35, 70, 283, 566, 1415, 1981, 2830, 3962, 9905, 19810.
What is 19810 in binary?
100110101100010 (hexadecimal 4D62, octal 46542).
What is the square root of 19810?
About 140.7480.
Is 19810 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 19810?
It is a composite number with 16 divisors.