The number 11568
11568 is a composite number with 20 divisors. Its prime factorisation is × 3 × 241. Divisors (20): 1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 241, 482, 723, 964, 1446, 1928 … 11568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11568 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11568 is composite. Its prime factorisation is
- 3
The divisors add up to 30008; without 11568 itself that is 18440, so 11568 is abundant (18440 is more than 11568). Euler's totient φ(11568) = 3840 numbers up to 11568 share no factor with it.
- 4
The digits of 11568 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 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11568 = 2^{4} \times 3 \times 241 \]11568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 30008 |
| Euler totient φ(n) | 3840 |
| Square | 133818624 |
| Cube | 1548013842432 |
| Square root | 107.554637 (= 4√723) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.1568 × |
11568 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand five hundred and sixty-eight |
| Binary (base 2) | 10110100110000 |
| Octal (base 8) | 26460 |
| Hexadecimal (base 16) | 2D30 |
| Base 3 | 120212110 |
| As time | 11568 seconds = 3 h 12 min 48 s |
Is 11568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11568 ÷ 2 = 5784) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11568 ÷ 3 = 3856) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (11568 ÷ 4 = 2892) | 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 | Yes (11568 ÷ 6 = 1928) | 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 | Yes (11568 ÷ 8 = 1446) | 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 8) | 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 | Yes (11568 ÷ 12 = 964) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11568 a prime number?
No. 11568 = × 3 × 241, so it is divisible by 2.
What are the factors of 11568?
1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 241, 482, 723, 964, 1446, 1928, 2892, 3856, 5784, 11568.
What is 11568 in binary?
10110100110000 (hexadecimal 2D30, octal 26460).
What is the square root of 11568?
About 107.5546, exactly 4√723.
Is 11568 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 11568?
It is a composite number with 20 divisors.