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