The number 19614
19614 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 7 × 467. Divisors (16): 1, 2, 3, 6, 7, 14, 21, 42, 467, 934, 1401, 2802, 3269, 6538, 9807, 19614.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19614: a Harshad number: divisible by its digit sum 21.
- 2
19614 is composite. Its prime factorisation is
- 3
The divisors add up to 44928; without 19614 itself that is 25314, so 19614 is abundant (25314 is more than 19614). Euler's totient φ(19614) = 5592 numbers up to 19614 share no factor with it.
- 4
The digits of 19614 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 105 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19614 = 2 \times 3 \times 7 \times 467 \]
19614 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 44928 |
| Euler totient φ(n) | 5592 |
| Square | 384708996 |
| Cube | 7545682247544 |
| Square root | 140.049991 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 105 |
| Scientific notation | 1.9614 × |
19614 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and fourteen |
| Binary (base 2) | 100110010011110 |
| Octal (base 8) | 46236 |
| Hexadecimal (base 16) | 4C9E |
| Base 3 | 222220110 |
| As time | 19614 seconds = 5 h 26 min 54 s |
Is 19614 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19614 ÷ 2 = 9807) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (19614 ÷ 3 = 6538) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (19614 ÷ 6 = 3269) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (19614 ÷ 7 = 2802) | 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 6) | 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 4) | 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 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19614 a prime number?
No. 19614 = 2 × 3 × 7 × 467, so it is divisible by 2.
What are the factors of 19614?
1, 2, 3, 6, 7, 14, 21, 42, 467, 934, 1401, 2802, 3269, 6538, 9807, 19614.
What is 19614 in binary?
100110010011110 (hexadecimal 4C9E, octal 46236).
What is the square root of 19614?
About 140.0500.
Is 19614 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 19614?
19614 is a Harshad number: divisible by its digit sum 21.