The number 19601
19601 is a composite number with 4 divisors. Its prime factorisation is 17 × 1153. Divisors (4): 1, 17, 1153, 19601.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19601: a Harshad number: divisible by its digit sum 17; a semiprime: 17 × 1153, the product of two primes.
- 2
19601 is composite. Its prime factorisation is
- 3
The divisors add up to 20772; without 19601 itself that is 1171, so 19601 is deficient (1171 is less than 19601). Euler's totient φ(19601) = 18432 numbers up to 19601 share no factor with it.
- 4
The digits of 19601 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 105 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19601 = 17 \times 1153 \]
19601 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20772 |
| Euler totient φ(n) | 18432 |
| Square | 384199201 |
| Cube | 7530688538801 |
| Square root | 140.003571 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 105 |
| Scientific notation | 1.9601 × |
19601 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and one |
| Binary (base 2) | 100110010010001 |
| Octal (base 8) | 46221 |
| Hexadecimal (base 16) | 4C91 |
| Base 3 | 222212222 |
| As time | 19601 seconds = 5 h 26 min 41 s |
Is 19601 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 1) | 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 1) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19601 a prime number?
No. 19601 = 17 × 1153, so it is divisible by 17.
What are the factors of 19601?
1, 17, 1153, 19601.
What is 19601 in binary?
100110010010001 (hexadecimal 4C91, octal 46221).
What is the square root of 19601?
About 140.0036.
Is 19601 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 19601?
19601 is a Harshad number: divisible by its digit sum 17; a semiprime: 17 × 1153, the product of two primes.