The number 52537
52537 is a composite number with 4 divisors. Its prime factorisation is 107 × 491. Divisors (4): 1, 107, 491, 52537.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52537: a semiprime: 107 × 491, the product of two primes.
- 2
52537 is composite. Its prime factorisation is
- 3
The divisors add up to 53136; without 52537 itself that is 599, so 52537 is deficient (599 is less than 52537). Euler's totient φ(52537) = 51940 numbers up to 52537 share no factor with it.
- 4
The digits of 52537 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 246 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52537 = 107 \times 491 \]
52537 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53136 |
| Euler totient φ(n) | 51940 |
| Square | 2760136369 |
| Cube | 145009284418153 |
| Square root | 229.209511 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 246 |
| Scientific notation | 5.2537 × |
52537 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand five hundred and thirty-seven |
| Binary (base 2) | 1100110100111001 |
| Octal (base 8) | 146471 |
| Hexadecimal (base 16) | CD39 |
| Base 3 | 2200001211 |
| As time | 52537 seconds = 14 h 35 min 37 s |
Is 52537 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 4) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52537 a prime number?
No. 52537 = 107 × 491, so it is divisible by 107.
What are the factors of 52537?
1, 107, 491, 52537.
What is 52537 in binary?
1100110100111001 (hexadecimal CD39, octal 146471).
What is the square root of 52537?
About 229.2095.
Is 52537 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 52537?
52537 is a semiprime: 107 × 491, the product of two primes.