The number 11153
11153 is a composite number with 4 divisors. Its prime factorisation is 19 × 587. Divisors (4): 1, 19, 587, 11153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11153: a semiprime: 19 × 587, the product of two primes.
- 2
11153 is composite. Its prime factorisation is
- 3
The divisors add up to 11760; without 11153 itself that is 607, so 11153 is deficient (607 is less than 11153). Euler's totient φ(11153) = 10548 numbers up to 11153 share no factor with it.
- 4
The digits of 11153 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11153 = 19 \times 587 \]
11153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11760 |
| Euler totient φ(n) | 10548 |
| Square | 124389409 |
| Cube | 1387315078577 |
| Square root | 105.607765 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.1153 × |
11153 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and fifty-three |
| Binary (base 2) | 10101110010001 |
| Octal (base 8) | 25621 |
| Hexadecimal (base 16) | 2B91 |
| Base 3 | 120022002 |
| As time | 11153 seconds = 3 h 5 min 53 s |
Is 11153 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 2) | 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 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11153 a prime number?
No. 11153 = 19 × 587, so it is divisible by 19.
What are the factors of 11153?
1, 19, 587, 11153.
What is 11153 in binary?
10101110010001 (hexadecimal 2B91, octal 25621).
What is the square root of 11153?
About 105.6078.
Is 11153 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 11153?
11153 is a semiprime: 19 × 587, the product of two primes.