The number 11056
11056 is a composite number with 10 divisors. Its prime factorisation is × 691. Divisors (10): 1, 2, 4, 8, 16, 691, 1382, 2764, 5528, 11056.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11056 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11056 is composite. Its prime factorisation is
- 3
The divisors add up to 21452; without 11056 itself that is 10396, so 11056 is deficient (10396 is less than 11056). Euler's totient φ(11056) = 5520 numbers up to 11056 share no factor with it.
- 4
The digits of 11056 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11056 = 2^{4} \times 691 \]11056 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 21452 |
| Euler totient φ(n) | 5520 |
| Square | 122235136 |
| Cube | 1351431663616 |
| Square root | 105.147515 (= 4√691) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.1056 × |
11056 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand and fifty-six |
| Binary (base 2) | 10101100110000 |
| Octal (base 8) | 25460 |
| Hexadecimal (base 16) | 2B30 |
| Base 3 | 120011111 |
| As time | 11056 seconds = 3 h 4 min 16 s |
Is 11056 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11056 ÷ 2 = 5528) | 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 (11056 ÷ 4 = 2764) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 (11056 ÷ 8 = 1382) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 1) | 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 11056 a prime number?
No. 11056 = × 691, so it is divisible by 2.
What are the factors of 11056?
1, 2, 4, 8, 16, 691, 1382, 2764, 5528, 11056.
What is 11056 in binary?
10101100110000 (hexadecimal 2B30, octal 25460).
What is the square root of 11056?
About 105.1475, exactly 4√691.
Is 11056 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 11056?
It is a composite number with 10 divisors.