The number 11150
11150 is a composite number with 12 divisors. Its prime factorisation is 2 × × 223. Divisors (12): 1, 2, 5, 10, 25, 50, 223, 446, 1115, 2230, 5575, 11150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11150: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
11150 is composite. Its prime factorisation is
- 3
The divisors add up to 20832; without 11150 itself that is 9682, so 11150 is deficient (9682 is less than 11150). Euler's totient φ(11150) = 4440 numbers up to 11150 share no factor with it.
- 4
The digits of 11150 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11150 = 2 \times 5^{2} \times 223 \]11150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 20832 |
| Euler totient φ(n) | 4440 |
| Square | 124322500 |
| Cube | 1386195875000 |
| Square root | 105.593560 (= 5√446) |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.115 × |
11150 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and fifty |
| Binary (base 2) | 10101110001110 |
| Octal (base 8) | 25616 |
| Hexadecimal (base 16) | 2B8E |
| Base 3 | 120021222 |
| As time | 11150 seconds = 3 h 5 min 50 s |
Is 11150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11150 ÷ 2 = 5575) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (11150 ÷ 5 = 2230) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 | No (remainder 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11150 ÷ 10 = 1115) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11150 a prime number?
No. 11150 = 2 × × 223, so it is divisible by 2.
What are the factors of 11150?
1, 2, 5, 10, 25, 50, 223, 446, 1115, 2230, 5575, 11150.
What is 11150 in binary?
10101110001110 (hexadecimal 2B8E, octal 25616).
What is the square root of 11150?
About 105.5936, exactly 5√446.
Is 11150 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 11150?
11150 is a happy number: repeatedly adding the squares of its digits reaches 1.