The number 49142
49142 is a composite number with 4 divisors. Its prime factorisation is 2 × 24571. Divisors (4): 1, 2, 24571, 49142.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49142: a semiprime: 2 × 24571, the product of two primes.
- 2
49142 is composite. Its prime factorisation is
- 3
The divisors add up to 73716; without 49142 itself that is 24574, so 49142 is deficient (24574 is less than 49142). Euler's totient φ(49142) = 24570 numbers up to 49142 share no factor with it.
- 4
The digits of 49142 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49142 = 2 \times 24571 \]
49142 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 73716 |
| Euler totient φ(n) | 24570 |
| Square | 2414936164 |
| Cube | 118674792971288 |
| Square root | 221.679949 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9142 × |
49142 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and forty-two |
| Binary (base 2) | 1011111111110110 |
| Octal (base 8) | 137766 |
| Hexadecimal (base 16) | BFF6 |
| Base 3 | 2111102002 |
| As time | 49142 seconds = 13 h 39 min 2 s |
Is 49142 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49142 ÷ 2 = 24571) | 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 2) | 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 2) | 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 49142 a prime number?
No. 49142 = 2 × 24571, so it is divisible by 2.
What are the factors of 49142?
1, 2, 24571, 49142.
What is 49142 in binary?
1011111111110110 (hexadecimal BFF6, octal 137766).
What is the square root of 49142?
About 221.6799.
Is 49142 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 49142?
49142 is a semiprime: 2 × 24571, the product of two primes.