The number 9567
9567 is a composite number with 6 divisors. Its prime factorisation is × 1063. Divisors (6): 1, 3, 9, 1063, 3189, 9567.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9567 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9567 is composite. Its prime factorisation is
- 3
The divisors add up to 13832; without 9567 itself that is 4265, so 9567 is deficient (4265 is less than 9567). Euler's totient φ(9567) = 6372 numbers up to 9567 share no factor with it.
- 4
The digits of 9567 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9567 = 3^{2} \times 1063 \]9567 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 13832 |
| Euler totient φ(n) | 6372 |
| Square | 91527489 |
| Cube | 875643487263 |
| Square root | 97.811042 (= 3√1063) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 78 |
| Scientific notation | 9.567 × |
9567 in other forms
| Form | Value |
|---|---|
| In words | nine thousand five hundred and sixty-seven |
| Binary (base 2) | 10010101011111 |
| Octal (base 8) | 22537 |
| Hexadecimal (base 16) | 255F |
| Base 3 | 111010100 |
| As time | 9567 seconds = 2 h 39 min 27 s |
Is 9567 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 (9567 ÷ 3 = 3189) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (9567 ÷ 9 = 1063) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9567 a prime number?
No. 9567 = × 1063, so it is divisible by 3.
What are the factors of 9567?
1, 3, 9, 1063, 3189, 9567.
What is 9567 in binary?
10010101011111 (hexadecimal 255F, octal 22537).
What is the square root of 9567?
About 97.8110, exactly 3√1063.
Is 9567 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 9567?
It is a composite number with 6 divisors.