The number 19690
19690 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 11 × 179. Divisors (16): 1, 2, 5, 10, 11, 22, 55, 110, 179, 358, 895, 1790, 1969, 3938, 9845, 19690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19690 is composite. Its prime factorisation is
- 3
The divisors add up to 38880; without 19690 itself that is 19190, so 19690 is deficient (19190 is less than 19690). Euler's totient φ(19690) = 7120 numbers up to 19690 share no factor with it.
- 4
The digits of 19690 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 74 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19690 = 2 \times 5 \times 11 \times 179 \]
19690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 38880 |
| Euler totient φ(n) | 7120 |
| Square | 387696100 |
| Cube | 7633736209000 |
| Square root | 140.321060 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 74 |
| Scientific notation | 1.969 × |
19690 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and ninety |
| Binary (base 2) | 100110011101010 |
| Octal (base 8) | 46352 |
| Hexadecimal (base 16) | 4CEA |
| Base 3 | 1000000021 |
| As time | 19690 seconds = 5 h 28 min 10 s |
Is 19690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19690 ÷ 2 = 9845) | 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 (19690 ÷ 5 = 3938) | 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 | No (remainder 6) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (19690 ÷ 10 = 1969) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (19690 ÷ 11 = 1790) | 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 19690 a prime number?
No. 19690 = 2 × 5 × 11 × 179, so it is divisible by 2.
What are the factors of 19690?
1, 2, 5, 10, 11, 22, 55, 110, 179, 358, 895, 1790, 1969, 3938, 9845, 19690.
What is 19690 in binary?
100110011101010 (hexadecimal 4CEA, octal 46352).
What is the square root of 19690?
About 140.3211.
Is 19690 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 19690?
It is a composite number with 16 divisors.