The number 11142
11142 is a composite number with 12 divisors. Its prime factorisation is 2 × × 619. Divisors (12): 1, 2, 3, 6, 9, 18, 619, 1238, 1857, 3714, 5571, 11142.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11142: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.
- 2
11142 is composite. Its prime factorisation is
- 3
The divisors add up to 24180; without 11142 itself that is 13038, so 11142 is abundant (13038 is more than 11142). Euler's totient φ(11142) = 3708 numbers up to 11142 share no factor with it.
- 4
The digits of 11142 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11142 = 2 \times 3^{2} \times 619 \]11142 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 24180 |
| Euler totient φ(n) | 3708 |
| Square | 124144164 |
| Cube | 1383214275288 |
| Square root | 105.555673 (= 3√1238) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.1142 × |
11142 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and forty-two |
| Binary (base 2) | 10101110000110 |
| Octal (base 8) | 25606 |
| Hexadecimal (base 16) | 2B86 |
| Base 3 | 120021200 |
| As time | 11142 seconds = 3 h 5 min 42 s |
Is 11142 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11142 ÷ 2 = 5571) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11142 ÷ 3 = 3714) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (11142 ÷ 6 = 1857) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (11142 ÷ 9 = 1238) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11142 a prime number?
No. 11142 = 2 × × 619, so it is divisible by 2.
What are the factors of 11142?
1, 2, 3, 6, 9, 18, 619, 1238, 1857, 3714, 5571, 11142.
What is 11142 in binary?
10101110000110 (hexadecimal 2B86, octal 25606).
What is the square root of 11142?
About 105.5557, exactly 3√1238.
Is 11142 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 11142?
11142 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.