The number 19621
19621 is a composite number with 4 divisors. Its prime factorisation is 7 × 2803. Divisors (4): 1, 7, 2803, 19621.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19621: a semiprime: 7 × 2803, the product of two primes.
- 2
19621 is composite. Its prime factorisation is
- 3
The divisors add up to 22432; without 19621 itself that is 2811, so 19621 is deficient (2811 is less than 19621). Euler's totient φ(19621) = 16812 numbers up to 19621 share no factor with it.
- 4
The digits of 19621 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 167 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19621 = 7 \times 2803 \]
19621 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 22432 |
| Euler totient φ(n) | 16812 |
| Square | 384983641 |
| Cube | 7553764020061 |
| Square root | 140.074980 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 167 |
| Scientific notation | 1.9621 × |
19621 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and twenty-one |
| Binary (base 2) | 100110010100101 |
| Octal (base 8) | 46245 |
| Hexadecimal (base 16) | 4CA5 |
| Base 3 | 222220201 |
| As time | 19621 seconds = 5 h 27 min 1 s |
Is 19621 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 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (19621 ÷ 7 = 2803) | 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 5) | 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 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19621 a prime number?
No. 19621 = 7 × 2803, so it is divisible by 7.
What are the factors of 19621?
1, 7, 2803, 19621.
What is 19621 in binary?
100110010100101 (hexadecimal 4CA5, octal 46245).
What is the square root of 19621?
About 140.0750.
Is 19621 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 19621?
19621 is a semiprime: 7 × 2803, the product of two primes.