The number 11127
11127 is a composite number with 4 divisors. Its prime factorisation is 3 × 3709. Divisors (4): 1, 3, 3709, 11127.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11127: a semiprime: 3 × 3709, the product of two primes.
- 2
11127 is composite. Its prime factorisation is
- 3
The divisors add up to 14840; without 11127 itself that is 3713, so 11127 is deficient (3713 is less than 11127). Euler's totient φ(11127) = 7416 numbers up to 11127 share no factor with it.
- 4
The digits of 11127 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 117 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11127 = 3 \times 3709 \]
11127 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14840 |
| Euler totient φ(n) | 7416 |
| Square | 123810129 |
| Cube | 1377635305383 |
| Square root | 105.484596 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 117 |
| Scientific notation | 1.1127 × |
11127 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and twenty-seven |
| Binary (base 2) | 10101101110111 |
| Octal (base 8) | 25567 |
| Hexadecimal (base 16) | 2B77 |
| Base 3 | 120021010 |
| As time | 11127 seconds = 3 h 5 min 27 s |
Is 11127 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 (11127 ÷ 3 = 3709) | 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 | No (remainder 2) | 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 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 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 7) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11127 a prime number?
No. 11127 = 3 × 3709, so it is divisible by 3.
What are the factors of 11127?
1, 3, 3709, 11127.
What is 11127 in binary?
10101101110111 (hexadecimal 2B77, octal 25567).
What is the square root of 11127?
About 105.4846.
Is 11127 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 11127?
11127 is a semiprime: 3 × 3709, the product of two primes.