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