The number 11143
11143 is a composite number with 4 divisors. Its prime factorisation is 11 × 1013. Divisors (4): 1, 11, 1013, 11143.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11143: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 1013, the product of two primes.
- 2
11143 is composite. Its prime factorisation is
- 3
The divisors add up to 12168; without 11143 itself that is 1025, so 11143 is deficient (1025 is less than 11143). Euler's totient φ(11143) = 10120 numbers up to 11143 share no factor with it.
- 4
The digits of 11143 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 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11143 = 11 \times 1013 \]
11143 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12168 |
| Euler totient φ(n) | 10120 |
| Square | 124166449 |
| Cube | 1383586741207 |
| Square root | 105.560409 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.1143 × |
11143 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and forty-three |
| Binary (base 2) | 10101110000111 |
| Octal (base 8) | 25607 |
| Hexadecimal (base 16) | 2B87 |
| Base 3 | 120021201 |
| As time | 11143 seconds = 3 h 5 min 43 s |
Is 11143 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 3) | 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 | No (remainder 6) | 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 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 | Yes (11143 ÷ 11 = 1013) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11143 a prime number?
No. 11143 = 11 × 1013, so it is divisible by 11.
What are the factors of 11143?
1, 11, 1013, 11143.
What is 11143 in binary?
10101110000111 (hexadecimal 2B87, octal 25607).
What is the square root of 11143?
About 105.5604.
Is 11143 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 11143?
11143 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 1013, the product of two primes.