The number 1142
1142 is a composite number with 4 divisors. Its prime factorisation is 2 × 571. Divisors (4): 1, 2, 571, 1142.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1142: a semiprime: 2 × 571, the product of two primes.
- 2
1142 is composite. Its prime factorisation is
- 3
The divisors add up to 1716; without 1142 itself that is 574, so 1142 is deficient (574 is less than 1142). Euler's totient φ(1142) = 570 numbers up to 1142 share no factor with it.
- 4
The digits of 1142 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1142 = 2 \times 571 \]
1142 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1716 |
| Euler totient φ(n) | 570 |
| Square | 1304164 |
| Cube | 1489355288 |
| Square root | 33.793490 |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 31 |
| Scientific notation | 1.142 × |
1142 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and forty-two |
| Roman numerals | MCXLII |
| Binary (base 2) | 10001110110 |
| Octal (base 8) | 2166 |
| Hexadecimal (base 16) | 476 |
| Base 3 | 1120022 |
| As time | 1142 seconds = 19 min 2 s |
Is 1142 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1142 ÷ 2 = 571) | 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 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 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | No (remainder 8) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1142 a prime number?
No. 1142 = 2 × 571, so it is divisible by 2.
What are the factors of 1142?
1, 2, 571, 1142.
What is 1142 in binary?
10001110110 (hexadecimal 476, octal 2166).
What is the square root of 1142?
About 33.7935.
What is 1142 in Roman numerals?
MCXLII.
Is 1142 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 1142?
1142 is a semiprime: 2 × 571, the product of two primes.