The number 20561
20561 is a composite number with 4 divisors. Its prime factorisation is 29 × 709. Divisors (4): 1, 29, 709, 20561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20561: a semiprime: 29 × 709, the product of two primes.
- 2
20561 is composite. Its prime factorisation is
- 3
The divisors add up to 21300; without 20561 itself that is 739, so 20561 is deficient (739 is less than 20561). Euler's totient φ(20561) = 19824 numbers up to 20561 share no factor with it.
- 4
The digits of 20561 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 56 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20561 = 29 \times 709 \]
20561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 21300 |
| Euler totient φ(n) | 19824 |
| Square | 422754721 |
| Cube | 8692259818481 |
| Square root | 143.391074 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 56 |
| Scientific notation | 2.0561 × |
20561 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand five hundred and sixty-one |
| Binary (base 2) | 101000001010001 |
| Octal (base 8) | 50121 |
| Hexadecimal (base 16) | 5051 |
| Base 3 | 1001012112 |
| As time | 20561 seconds = 5 h 42 min 41 s |
Is 20561 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 2) | 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 5) | 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 2) | 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 20561 a prime number?
No. 20561 = 29 × 709, so it is divisible by 29.
What are the factors of 20561?
1, 29, 709, 20561.
What is 20561 in binary?
101000001010001 (hexadecimal 5051, octal 50121).
What is the square root of 20561?
About 143.3911.
Is 20561 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 20561?
20561 is a semiprime: 29 × 709, the product of two primes.