The number 50537
50537 is a composite number with 4 divisors. Its prime factorisation is 97 × 521. Divisors (4): 1, 97, 521, 50537.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50537: a semiprime: 97 × 521, the product of two primes.
- 2
50537 is composite. Its prime factorisation is
- 3
The divisors add up to 51156; without 50537 itself that is 619, so 50537 is deficient (619 is less than 50537). Euler's totient φ(50537) = 49920 numbers up to 50537 share no factor with it.
- 4
The digits of 50537 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50537 = 97 \times 521 \]
50537 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51156 |
| Euler totient φ(n) | 49920 |
| Square | 2553988369 |
| Cube | 129070910204153 |
| Square root | 224.804359 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0537 × |
50537 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and thirty-seven |
| Binary (base 2) | 1100010101101001 |
| Octal (base 8) | 142551 |
| Hexadecimal (base 16) | C569 |
| Base 3 | 2120022202 |
| As time | 50537 seconds = 14 h 2 min 17 s |
Is 50537 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 1) | 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 5) | 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 1) | 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 7) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50537 a prime number?
No. 50537 = 97 × 521, so it is divisible by 97.
What are the factors of 50537?
1, 97, 521, 50537.
What is 50537 in binary?
1100010101101001 (hexadecimal C569, octal 142551).
What is the square root of 50537?
About 224.8044.
Is 50537 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50537?
50537 is a semiprime: 97 × 521, the product of two primes.