The number 50702
50702 is a composite number with 8 divisors. Its prime factorisation is 2 × 101 × 251. Divisors (8): 1, 2, 101, 202, 251, 502, 25351, 50702.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50702 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50702 is composite. Its prime factorisation is
- 3
The divisors add up to 77112; without 50702 itself that is 26410, so 50702 is deficient (26410 is less than 50702). Euler's totient φ(50702) = 25000 numbers up to 50702 share no factor with it.
- 4
The digits of 50702 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50702 = 2 \times 101 \times 251 \]
50702 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 77112 |
| Euler totient φ(n) | 25000 |
| Square | 2570692804 |
| Cube | 130339266548408 |
| Square root | 225.171046 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.0702 × |
50702 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand seven hundred and two |
| Binary (base 2) | 1100011000001110 |
| Octal (base 8) | 143016 |
| Hexadecimal (base 16) | C60E |
| Base 3 | 2120112212 |
| As time | 50702 seconds = 14 h 5 min 2 s |
Is 50702 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50702 ÷ 2 = 25351) | 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 1) | 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 5) | 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 3) | 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 50702 a prime number?
No. 50702 = 2 × 101 × 251, so it is divisible by 2.
What are the factors of 50702?
1, 2, 101, 202, 251, 502, 25351, 50702.
What is 50702 in binary?
1100011000001110 (hexadecimal C60E, octal 143016).
What is the square root of 50702?
About 225.1710.
Is 50702 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50702?
It is a composite number with 8 divisors.