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