The number 49642
49642 is a composite number with 4 divisors. Its prime factorisation is 2 × 24821. Divisors (4): 1, 2, 24821, 49642.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49642: a semiprime: 2 × 24821, the product of two primes.
- 2
49642 is composite. Its prime factorisation is
- 3
The divisors add up to 74466; without 49642 itself that is 24824, so 49642 is deficient (24824 is less than 49642). Euler's totient φ(49642) = 24820 numbers up to 49642 share no factor with it.
- 4
The digits of 49642 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49642 = 2 \times 24821 \]
49642 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 74466 |
| Euler totient φ(n) | 24820 |
| Square | 2464328164 |
| Cube | 122334178717288 |
| Square root | 222.804847 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9642 × |
49642 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and forty-two |
| Binary (base 2) | 1100000111101010 |
| Octal (base 8) | 140752 |
| Hexadecimal (base 16) | C1EA |
| Base 3 | 2112002121 |
| As time | 49642 seconds = 13 h 47 min 22 s |
Is 49642 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49642 ÷ 2 = 24821) | 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 5) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 10) | 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 49642 a prime number?
No. 49642 = 2 × 24821, so it is divisible by 2.
What are the factors of 49642?
1, 2, 24821, 49642.
What is 49642 in binary?
1100000111101010 (hexadecimal C1EA, octal 140752).
What is the square root of 49642?
About 222.8048.
Is 49642 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49642?
49642 is a semiprime: 2 × 24821, the product of two primes.