The number 17561
17561 is a composite number with 4 divisors. Its prime factorisation is 17 × 1033. Divisors (4): 1, 17, 1033, 17561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 17561: a semiprime: 17 × 1033, the product of two primes.
- 2
17561 is composite. Its prime factorisation is
- 3
The divisors add up to 18612; without 17561 itself that is 1051, so 17561 is deficient (1051 is less than 17561). Euler's totient φ(17561) = 16512 numbers up to 17561 share no factor with it.
- 4
The digits of 17561 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 141 steps to reach 1.
LaTeX source of the formulas on this page
\[ 17561 = 17 \times 1033 \]
17561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 18612 |
| Euler totient φ(n) | 16512 |
| Square | 308388721 |
| Cube | 5415614329481 |
| Square root | 132.517923 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 141 |
| Scientific notation | 1.7561 × |
17561 in other forms
| Form | Value |
|---|---|
| In words | seventeen thousand five hundred and sixty-one |
| Binary (base 2) | 100010010011001 |
| Octal (base 8) | 42231 |
| Hexadecimal (base 16) | 4499 |
| Base 3 | 220002102 |
| As time | 17561 seconds = 4 h 52 min 41 s |
Is 17561 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 5) | 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 17561 a prime number?
No. 17561 = 17 × 1033, so it is divisible by 17.
What are the factors of 17561?
1, 17, 1033, 17561.
What is 17561 in binary?
100010010011001 (hexadecimal 4499, octal 42231).
What is the square root of 17561?
About 132.5179.
Is 17561 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 17561?
17561 is a semiprime: 17 × 1033, the product of two primes.