The number 9568
9568 is a composite number with 24 divisors. Its prime factorisation is × 13 × 23. Divisors (24): 1, 2, 4, 8, 13, 16, 23, 26, 32, 46, 52, 92, 104, 184, 208, 299 … 9568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9568 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9568 is composite. Its prime factorisation is
- 3
The divisors add up to 21168; without 9568 itself that is 11600, so 9568 is abundant (11600 is more than 9568). Euler's totient φ(9568) = 4224 numbers up to 9568 share no factor with it.
- 4
The digits of 9568 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9568 = 2^{5} \times 13 \times 23 \]9568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 21168 |
| Euler totient φ(n) | 4224 |
| Square | 91546624 |
| Cube | 875918098432 |
| Square root | 97.816154 (= 4√598) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 122 |
| Scientific notation | 9.568 × |
9568 in other forms
| Form | Value |
|---|---|
| In words | nine thousand five hundred and sixty-eight |
| Binary (base 2) | 10010101100000 |
| Octal (base 8) | 22540 |
| Hexadecimal (base 16) | 2560 |
| Base 3 | 111010101 |
| As time | 9568 seconds = 2 h 39 min 28 s |
Is 9568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9568 ÷ 2 = 4784) | 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 | Yes (9568 ÷ 4 = 2392) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 | Yes (9568 ÷ 8 = 1196) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9568 a prime number?
No. 9568 = × 13 × 23, so it is divisible by 2.
What are the factors of 9568?
1, 2, 4, 8, 13, 16, 23, 26, 32, 46, 52, 92, 104, 184, 208, 299, 368, 416, 598, 736, 1196, 2392, 4784, 9568.
What is 9568 in binary?
10010101100000 (hexadecimal 2560, octal 22540).
What is the square root of 9568?
About 97.8162, exactly 4√598.
Is 9568 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 9568?
It is a composite number with 24 divisors.