The number 11152
11152 is a composite number with 20 divisors. Its prime factorisation is × 17 × 41. Divisors (20): 1, 2, 4, 8, 16, 17, 34, 41, 68, 82, 136, 164, 272, 328, 656, 697 … 11152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11152: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
11152 is composite. Its prime factorisation is
- 3
The divisors add up to 23436; without 11152 itself that is 12284, so 11152 is abundant (12284 is more than 11152). Euler's totient φ(11152) = 5120 numbers up to 11152 share no factor with it.
- 4
The digits of 11152 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11152 = 2^{4} \times 17 \times 41 \]11152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 23436 |
| Euler totient φ(n) | 5120 |
| Square | 124367104 |
| Cube | 1386941943808 |
| Square root | 105.603030 (= 4√697) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.1152 × |
11152 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and fifty-two |
| Binary (base 2) | 10101110010000 |
| Octal (base 8) | 25620 |
| Hexadecimal (base 16) | 2B90 |
| Base 3 | 120022001 |
| As time | 11152 seconds = 3 h 5 min 52 s |
Is 11152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11152 ÷ 2 = 5576) | 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 (11152 ÷ 4 = 2788) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 (11152 ÷ 8 = 1394) | 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 2) | 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 11152 a prime number?
No. 11152 = × 17 × 41, so it is divisible by 2.
What are the factors of 11152?
1, 2, 4, 8, 16, 17, 34, 41, 68, 82, 136, 164, 272, 328, 656, 697, 1394, 2788, 5576, 11152.
What is 11152 in binary?
10101110010000 (hexadecimal 2B90, octal 25620).
What is the square root of 11152?
About 105.6030, exactly 4√697.
Is 11152 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 11152?
11152 is a happy number: repeatedly adding the squares of its digits reaches 1.