The number 11561
11561 is a composite number with 4 divisors. Its prime factorisation is 11 × 1051. Divisors (4): 1, 11, 1051, 11561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11561: a semiprime: 11 × 1051, the product of two primes.
- 2
11561 is composite. Its prime factorisation is
- 3
The divisors add up to 12624; without 11561 itself that is 1063, so 11561 is deficient (1063 is less than 11561). Euler's totient φ(11561) = 10500 numbers up to 11561 share no factor with it.
- 4
The digits of 11561 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 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11561 = 11 \times 1051 \]
11561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12624 |
| Euler totient φ(n) | 10500 |
| Square | 133656721 |
| Cube | 1545205351481 |
| Square root | 107.522091 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.1561 × |
11561 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand five hundred and sixty-one |
| Binary (base 2) | 10110100101001 |
| Octal (base 8) | 26451 |
| Hexadecimal (base 16) | 2D29 |
| Base 3 | 120212012 |
| As time | 11561 seconds = 3 h 12 min 41 s |
Is 11561 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 4) | 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 | Yes (11561 ÷ 11 = 1051) | 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 11561 a prime number?
No. 11561 = 11 × 1051, so it is divisible by 11.
What are the factors of 11561?
1, 11, 1051, 11561.
What is 11561 in binary?
10110100101001 (hexadecimal 2D29, octal 26451).
What is the square root of 11561?
About 107.5221.
Is 11561 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 11561?
11561 is a semiprime: 11 × 1051, the product of two primes.