The number 9561
9561 is a composite number with 4 divisors. Its prime factorisation is 3 × 3187. Divisors (4): 1, 3, 3187, 9561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9561: a semiprime: 3 × 3187, the product of two primes.
- 2
9561 is composite. Its prime factorisation is
- 3
The divisors add up to 12752; without 9561 itself that is 3191, so 9561 is deficient (3191 is less than 9561). Euler's totient φ(9561) = 6372 numbers up to 9561 share no factor with it.
- 4
The digits of 9561 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9561 = 3 \times 3187 \]
9561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12752 |
| Euler totient φ(n) | 6372 |
| Square | 91412721 |
| Cube | 873997025481 |
| Square root | 97.780366 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 78 |
| Scientific notation | 9.561 × |
9561 in other forms
| Form | Value |
|---|---|
| In words | nine thousand five hundred and sixty-one |
| Binary (base 2) | 10010101011001 |
| Octal (base 8) | 22531 |
| Hexadecimal (base 16) | 2559 |
| Base 3 | 111010010 |
| As time | 9561 seconds = 2 h 39 min 21 s |
Is 9561 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 | Yes (9561 ÷ 3 = 3187) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9561 a prime number?
No. 9561 = 3 × 3187, so it is divisible by 3.
What are the factors of 9561?
1, 3, 3187, 9561.
What is 9561 in binary?
10010101011001 (hexadecimal 2559, octal 22531).
What is the square root of 9561?
About 97.7804.
Is 9561 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 9561?
9561 is a semiprime: 3 × 3187, the product of two primes.