The number 50762
50762 is a composite number with 8 divisors. Its prime factorisation is 2 × 17 × 1493. Divisors (8): 1, 2, 17, 34, 1493, 2986, 25381, 50762.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50762 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50762 is composite. Its prime factorisation is
- 3
The divisors add up to 80676; without 50762 itself that is 29914, so 50762 is deficient (29914 is less than 50762). Euler's totient φ(50762) = 23872 numbers up to 50762 share no factor with it.
- 4
The digits of 50762 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 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50762 = 2 \times 17 \times 1493 \]
50762 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 80676 |
| Euler totient φ(n) | 23872 |
| Square | 2576780644 |
| Cube | 130802539050728 |
| Square root | 225.304239 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.0762 × |
50762 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand seven hundred and sixty-two |
| Binary (base 2) | 1100011001001010 |
| Octal (base 8) | 143112 |
| Hexadecimal (base 16) | C64A |
| Base 3 | 2120122002 |
| As time | 50762 seconds = 14 h 6 min 2 s |
Is 50762 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50762 ÷ 2 = 25381) | 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 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 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 8) | 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 50762 a prime number?
No. 50762 = 2 × 17 × 1493, so it is divisible by 2.
What are the factors of 50762?
1, 2, 17, 34, 1493, 2986, 25381, 50762.
What is 50762 in binary?
1100011001001010 (hexadecimal C64A, octal 143112).
What is the square root of 50762?
About 225.3042.
Is 50762 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50762?
It is a composite number with 8 divisors.