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