The number 10142
10142 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 461. Divisors (8): 1, 2, 11, 22, 461, 922, 5071, 10142.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10142 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10142 is composite. Its prime factorisation is
- 3
The divisors add up to 16632; without 10142 itself that is 6490, so 10142 is deficient (6490 is less than 10142). Euler's totient φ(10142) = 4600 numbers up to 10142 share no factor with it.
- 4
The digits of 10142 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 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10142 = 2 \times 11 \times 461 \]
10142 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 16632 |
| Euler totient φ(n) | 4600 |
| Square | 102860164 |
| Cube | 1043207783288 |
| Square root | 100.707497 |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 86 |
| Scientific notation | 1.0142 × |
10142 in other forms
| Form | Value |
|---|---|
| In words | ten thousand one hundred and forty-two |
| Binary (base 2) | 10011110011110 |
| Octal (base 8) | 23636 |
| Hexadecimal (base 16) | 279E |
| Base 3 | 111220122 |
| As time | 10142 seconds = 2 h 49 min 2 s |
Is 10142 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10142 ÷ 2 = 5071) | 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 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 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 | Yes (10142 ÷ 11 = 922) | 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 10142 a prime number?
No. 10142 = 2 × 11 × 461, so it is divisible by 2.
What are the factors of 10142?
1, 2, 11, 22, 461, 922, 5071, 10142.
What is 10142 in binary?
10011110011110 (hexadecimal 279E, octal 23636).
What is the square root of 10142?
About 100.7075.
Is 10142 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 10142?
It is a composite number with 8 divisors.