The number 50782
50782 is a composite number with 4 divisors. Its prime factorisation is 2 × 25391. Divisors (4): 1, 2, 25391, 50782.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50782: a semiprime: 2 × 25391, the product of two primes.
- 2
50782 is composite. Its prime factorisation is
- 3
The divisors add up to 76176; without 50782 itself that is 25394, so 50782 is deficient (25394 is less than 50782). Euler's totient φ(50782) = 25390 numbers up to 50782 share no factor with it.
- 4
The digits of 50782 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50782 = 2 \times 25391 \]
50782 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 76176 |
| Euler totient φ(n) | 25390 |
| Square | 2578811524 |
| Cube | 130957206811768 |
| Square root | 225.348619 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0782 × |
50782 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand seven hundred and eighty-two |
| Binary (base 2) | 1100011001011110 |
| Octal (base 8) | 143136 |
| Hexadecimal (base 16) | C65E |
| Base 3 | 2120122211 |
| As time | 50782 seconds = 14 h 6 min 22 s |
Is 50782 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50782 ÷ 2 = 25391) | 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 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 50782 a prime number?
No. 50782 = 2 × 25391, so it is divisible by 2.
What are the factors of 50782?
1, 2, 25391, 50782.
What is 50782 in binary?
1100011001011110 (hexadecimal C65E, octal 143136).
What is the square root of 50782?
About 225.3486.
Is 50782 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 50782?
50782 is a semiprime: 2 × 25391, the product of two primes.