The number 11050
11050 is a composite number with 24 divisors. Its prime factorisation is 2 × × 13 × 17. Divisors (24): 1, 2, 5, 10, 13, 17, 25, 26, 34, 50, 65, 85, 130, 170, 221, 325 … 11050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11050 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11050 is composite. Its prime factorisation is
- 3
The divisors add up to 23436; without 11050 itself that is 12386, so 11050 is abundant (12386 is more than 11050). Euler's totient φ(11050) = 3840 numbers up to 11050 share no factor with it.
- 4
The digits of 11050 add up to 7, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11050 = 2 \times 5^{2} \times 13 \times 17 \]11050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 23436 |
| Euler totient φ(n) | 3840 |
| Square | 122102500 |
| Cube | 1349232625000 |
| Square root | 105.118980 (= 5√442) |
| Digit sum / digital root | 7 / 7 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.105 × |
11050 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand and fifty |
| Binary (base 2) | 10101100101010 |
| Octal (base 8) | 25452 |
| Hexadecimal (base 16) | 2B2A |
| Base 3 | 120011021 |
| As time | 11050 seconds = 3 h 4 min 10 s |
Is 11050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11050 ÷ 2 = 5525) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (11050 ÷ 5 = 2210) | 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 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 | No (remainder 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11050 ÷ 10 = 1105) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11050 a prime number?
No. 11050 = 2 × × 13 × 17, so it is divisible by 2.
What are the factors of 11050?
1, 2, 5, 10, 13, 17, 25, 26, 34, 50, 65, 85, 130, 170, 221, 325, 425, 442, 650, 850, 1105, 2210, 5525, 11050.
What is 11050 in binary?
10101100101010 (hexadecimal 2B2A, octal 25452).
What is the square root of 11050?
About 105.1190, exactly 5√442.
Is 11050 divisible by 3?
No. Its digits add up to 7, which is not a multiple of 3.
What is special about the number 11050?
It is a composite number with 24 divisors.