The number 11055
11055 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 11 × 67. Divisors (16): 1, 3, 5, 11, 15, 33, 55, 67, 165, 201, 335, 737, 1005, 2211, 3685, 11055.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11055 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11055 is composite. Its prime factorisation is
- 3
The divisors add up to 19584; without 11055 itself that is 8529, so 11055 is deficient (8529 is less than 11055). Euler's totient φ(11055) = 5280 numbers up to 11055 share no factor with it.
- 4
The digits of 11055 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 99 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11055 = 3 \times 5 \times 11 \times 67 \]
11055 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 19584 |
| Euler totient φ(n) | 5280 |
| Square | 122213025 |
| Cube | 1351064991375 |
| Square root | 105.142760 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 99 |
| Scientific notation | 1.1055 × |
11055 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand and fifty-five |
| Binary (base 2) | 10101100101111 |
| Octal (base 8) | 25457 |
| Hexadecimal (base 16) | 2B2F |
| Base 3 | 120011110 |
| As time | 11055 seconds = 3 h 4 min 15 s |
Is 11055 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11055 ÷ 3 = 3685) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (11055 ÷ 5 = 2211) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (11055 ÷ 11 = 1005) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11055 a prime number?
No. 11055 = 3 × 5 × 11 × 67, so it is divisible by 3.
What are the factors of 11055?
1, 3, 5, 11, 15, 33, 55, 67, 165, 201, 335, 737, 1005, 2211, 3685, 11055.
What is 11055 in binary?
10101100101111 (hexadecimal 2B2F, octal 25457).
What is the square root of 11055?
About 105.1428.
Is 11055 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 11055?
It is a composite number with 16 divisors.