The number 19561
19561 is a composite number with 4 divisors. Its prime factorisation is 31 × 631. Divisors (4): 1, 31, 631, 19561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19561: a semiprime: 31 × 631, the product of two primes.
- 2
19561 is composite. Its prime factorisation is
- 3
The divisors add up to 20224; without 19561 itself that is 663, so 19561 is deficient (663 is less than 19561). Euler's totient φ(19561) = 18900 numbers up to 19561 share no factor with it.
- 4
The digits of 19561 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 79 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19561 = 31 \times 631 \]
19561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20224 |
| Euler totient φ(n) | 18900 |
| Square | 382632721 |
| Cube | 7484678655481 |
| Square root | 139.860645 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 79 |
| Scientific notation | 1.9561 × |
19561 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand five hundred and sixty-one |
| Binary (base 2) | 100110001101001 |
| Octal (base 8) | 46151 |
| Hexadecimal (base 16) | 4C69 |
| Base 3 | 222211111 |
| As time | 19561 seconds = 5 h 26 min 1 s |
Is 19561 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 | No (remainder 3) | 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 4) | 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 3) | 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 19561 a prime number?
No. 19561 = 31 × 631, so it is divisible by 31.
What are the factors of 19561?
1, 31, 631, 19561.
What is 19561 in binary?
100110001101001 (hexadecimal 4C69, octal 46151).
What is the square root of 19561?
About 139.8606.
Is 19561 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 19561?
19561 is a semiprime: 31 × 631, the product of two primes.