The number 8561
8561 is a composite number with 4 divisors. Its prime factorisation is 7 × 1223. Divisors (4): 1, 7, 1223, 8561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 8561: a semiprime: 7 × 1223, the product of two primes.
- 2
8561 is composite. Its prime factorisation is
- 3
The divisors add up to 9792; without 8561 itself that is 1231, so 8561 is deficient (1231 is less than 8561). Euler's totient φ(8561) = 7332 numbers up to 8561 share no factor with it.
- 4
The digits of 8561 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 26 steps to reach 1.
LaTeX source of the formulas on this page
\[ 8561 = 7 \times 1223 \]
8561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 9792 |
| Euler totient φ(n) | 7332 |
| Square | 73290721 |
| Cube | 627441862481 |
| Square root | 92.525672 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 26 |
| Scientific notation | 8.561 × |
8561 in other forms
| Form | Value |
|---|---|
| In words | eight thousand five hundred and sixty-one |
| Binary (base 2) | 10000101110001 |
| Octal (base 8) | 20561 |
| Hexadecimal (base 16) | 2171 |
| Base 3 | 102202002 |
| As time | 8561 seconds = 2 h 22 min 41 s |
Is 8561 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 | Yes (8561 ÷ 7 = 1223) | 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 3) | 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 8561 a prime number?
No. 8561 = 7 × 1223, so it is divisible by 7.
What are the factors of 8561?
1, 7, 1223, 8561.
What is 8561 in binary?
10000101110001 (hexadecimal 2171, octal 20561).
What is the square root of 8561?
About 92.5257.
Is 8561 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 8561?
8561 is a semiprime: 7 × 1223, the product of two primes.