The number 11128
11128 is a composite number with 16 divisors. Its prime factorisation is × 13 × 107. Divisors (16): 1, 2, 4, 8, 13, 26, 52, 104, 107, 214, 428, 856, 1391, 2782, 5564, 11128.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11128: a Harshad number: divisible by its digit sum 13.
- 2
11128 is composite. Its prime factorisation is
- 3
The divisors add up to 22680; without 11128 itself that is 11552, so 11128 is abundant (11552 is more than 11128). Euler's totient φ(11128) = 5088 numbers up to 11128 share no factor with it.
- 4
The digits of 11128 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 117 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11128 = 2^{3} \times 13 \times 107 \]11128 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 22680 |
| Euler totient φ(n) | 5088 |
| Square | 123832384 |
| Cube | 1378006769152 |
| Square root | 105.489336 (= 2√2782) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 117 |
| Scientific notation | 1.1128 × |
11128 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and twenty-eight |
| Binary (base 2) | 10101101111000 |
| Octal (base 8) | 25570 |
| Hexadecimal (base 16) | 2B78 |
| Base 3 | 120021011 |
| As time | 11128 seconds = 3 h 5 min 28 s |
Is 11128 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11128 ÷ 2 = 5564) | 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 (11128 ÷ 4 = 2782) | 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 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 | Yes (11128 ÷ 8 = 1391) | 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 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 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11128 a prime number?
No. 11128 = × 13 × 107, so it is divisible by 2.
What are the factors of 11128?
1, 2, 4, 8, 13, 26, 52, 104, 107, 214, 428, 856, 1391, 2782, 5564, 11128.
What is 11128 in binary?
10101101111000 (hexadecimal 2B78, octal 25570).
What is the square root of 11128?
About 105.4893, exactly 2√2782.
Is 11128 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 11128?
11128 is a Harshad number: divisible by its digit sum 13.