The number 9566
9566 is a composite number with 4 divisors. Its prime factorisation is 2 × 4783. Divisors (4): 1, 2, 4783, 9566.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9566: a semiprime: 2 × 4783, the product of two primes.
- 2
9566 is composite. Its prime factorisation is
- 3
The divisors add up to 14352; without 9566 itself that is 4786, so 9566 is deficient (4786 is less than 9566). Euler's totient φ(9566) = 4782 numbers up to 9566 share no factor with it.
- 4
The digits of 9566 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9566 = 2 \times 4783 \]
9566 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14352 |
| Euler totient φ(n) | 4782 |
| Square | 91508356 |
| Cube | 875368933496 |
| Square root | 97.805930 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 78 |
| Scientific notation | 9.566 × |
9566 in other forms
| Form | Value |
|---|---|
| In words | nine thousand five hundred and sixty-six |
| Binary (base 2) | 10010101011110 |
| Octal (base 8) | 22536 |
| Hexadecimal (base 16) | 255E |
| Base 3 | 111010022 |
| As time | 9566 seconds = 2 h 39 min 26 s |
Is 9566 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9566 ÷ 2 = 4783) | 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 2) | 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 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9566 a prime number?
No. 9566 = 2 × 4783, so it is divisible by 2.
What are the factors of 9566?
1, 2, 4783, 9566.
What is 9566 in binary?
10010101011110 (hexadecimal 255E, octal 22536).
What is the square root of 9566?
About 97.8059.
Is 9566 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 9566?
9566 is a semiprime: 2 × 4783, the product of two primes.