The number 15142
15142 is a composite number with 8 divisors. Its prime factorisation is 2 × 67 × 113. Divisors (8): 1, 2, 67, 113, 134, 226, 7571, 15142.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15142 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15142 is composite. Its prime factorisation is
- 3
The divisors add up to 23256; without 15142 itself that is 8114, so 15142 is deficient (8114 is less than 15142). Euler's totient φ(15142) = 7392 numbers up to 15142 share no factor with it.
- 4
The digits of 15142 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15142 = 2 \times 67 \times 113 \]
15142 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 23256 |
| Euler totient φ(n) | 7392 |
| Square | 229280164 |
| Cube | 3471760243288 |
| Square root | 123.052834 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5142 × |
15142 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and forty-two |
| Binary (base 2) | 11101100100110 |
| Octal (base 8) | 35446 |
| Hexadecimal (base 16) | 3B26 |
| Base 3 | 202202211 |
| As time | 15142 seconds = 4 h 12 min 22 s |
Is 15142 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15142 ÷ 2 = 7571) | 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 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 4) | 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 4) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15142 a prime number?
No. 15142 = 2 × 67 × 113, so it is divisible by 2.
What are the factors of 15142?
1, 2, 67, 113, 134, 226, 7571, 15142.
What is 15142 in binary?
11101100100110 (hexadecimal 3B26, octal 35446).
What is the square root of 15142?
About 123.0528.
Is 15142 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 15142?
It is a composite number with 8 divisors.