The number 16142
16142 is a composite number with 8 divisors. Its prime factorisation is 2 × 7 × 1153. Divisors (8): 1, 2, 7, 14, 1153, 2306, 8071, 16142.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16142: a Harshad number: divisible by its digit sum 14.
- 2
16142 is composite. Its prime factorisation is
- 3
The divisors add up to 27696; without 16142 itself that is 11554, so 16142 is deficient (11554 is less than 16142). Euler's totient φ(16142) = 6912 numbers up to 16142 share no factor with it.
- 4
The digits of 16142 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16142 = 2 \times 7 \times 1153 \]
16142 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 27696 |
| Euler totient φ(n) | 6912 |
| Square | 260564164 |
| Cube | 4206026735288 |
| Square root | 127.051171 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.6142 × |
16142 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand one hundred and forty-two |
| Binary (base 2) | 11111100001110 |
| Octal (base 8) | 37416 |
| Hexadecimal (base 16) | 3F0E |
| Base 3 | 211010212 |
| As time | 16142 seconds = 4 h 29 min 2 s |
Is 16142 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16142 ÷ 2 = 8071) | 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 | Yes (16142 ÷ 7 = 2306) | 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 5) | 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 5) | 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 16142 a prime number?
No. 16142 = 2 × 7 × 1153, so it is divisible by 2.
What are the factors of 16142?
1, 2, 7, 14, 1153, 2306, 8071, 16142.
What is 16142 in binary?
11111100001110 (hexadecimal 3F0E, octal 37416).
What is the square root of 16142?
About 127.0512.
Is 16142 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 16142?
16142 is a Harshad number: divisible by its digit sum 14.