The number 19619
19619 is a composite number with 4 divisors. Its prime factorisation is 23 × 853. Divisors (4): 1, 23, 853, 19619.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19619: a semiprime: 23 × 853, the product of two primes.
- 2
19619 is composite. Its prime factorisation is
- 3
The divisors add up to 20496; without 19619 itself that is 877, so 19619 is deficient (877 is less than 19619). Euler's totient φ(19619) = 18744 numbers up to 19619 share no factor with it.
- 4
The digits of 19619 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 167 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19619 = 23 \times 853 \]
19619 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20496 |
| Euler totient φ(n) | 18744 |
| Square | 384905161 |
| Cube | 7551454353659 |
| Square root | 140.067841 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 167 |
| Scientific notation | 1.9619 × |
19619 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and nineteen |
| Binary (base 2) | 100110010100011 |
| Octal (base 8) | 46243 |
| Hexadecimal (base 16) | 4CA3 |
| Base 3 | 222220122 |
| As time | 19619 seconds = 5 h 26 min 59 s |
Is 19619 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19619 a prime number?
No. 19619 = 23 × 853, so it is divisible by 23.
What are the factors of 19619?
1, 23, 853, 19619.
What is 19619 in binary?
100110010100011 (hexadecimal 4CA3, octal 46243).
What is the square root of 19619?
About 140.0678.
Is 19619 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 19619?
19619 is a semiprime: 23 × 853, the product of two primes.