The number 11053
11053 is a composite number with 4 divisors. Its prime factorisation is 7 × 1579. Divisors (4): 1, 7, 1579, 11053.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11053: a semiprime: 7 × 1579, the product of two primes.
- 2
11053 is composite. Its prime factorisation is
- 3
The divisors add up to 12640; without 11053 itself that is 1587, so 11053 is deficient (1587 is less than 11053). Euler's totient φ(11053) = 9468 numbers up to 11053 share no factor with it.
- 4
The digits of 11053 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 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11053 = 7 \times 1579 \]
11053 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12640 |
| Euler totient φ(n) | 9468 |
| Square | 122168809 |
| Cube | 1350331845877 |
| Square root | 105.133249 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.1053 × |
11053 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand and fifty-three |
| Binary (base 2) | 10101100101101 |
| Octal (base 8) | 25455 |
| Hexadecimal (base 16) | 2B2D |
| Base 3 | 120011101 |
| As time | 11053 seconds = 3 h 4 min 13 s |
Is 11053 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 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (11053 ÷ 7 = 1579) | 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 5) | 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 3) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11053 a prime number?
No. 11053 = 7 × 1579, so it is divisible by 7.
What are the factors of 11053?
1, 7, 1579, 11053.
What is 11053 in binary?
10101100101101 (hexadecimal 2B2D, octal 25455).
What is the square root of 11053?
About 105.1332.
Is 11053 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 11053?
11053 is a semiprime: 7 × 1579, the product of two primes.