The number 52637
52637 is a composite number with 4 divisors. Its prime factorisation is 13 × 4049. Divisors (4): 1, 13, 4049, 52637.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52637: a semiprime: 13 × 4049, the product of two primes.
- 2
52637 is composite. Its prime factorisation is
- 3
The divisors add up to 56700; without 52637 itself that is 4063, so 52637 is deficient (4063 is less than 52637). Euler's totient φ(52637) = 48576 numbers up to 52637 share no factor with it.
- 4
The digits of 52637 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 215 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52637 = 13 \times 4049 \]
52637 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56700 |
| Euler totient φ(n) | 48576 |
| Square | 2770653769 |
| Cube | 145838902438853 |
| Square root | 229.427548 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 215 |
| Scientific notation | 5.2637 × |
52637 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand six hundred and thirty-seven |
| Binary (base 2) | 1100110110011101 |
| Octal (base 8) | 146635 |
| Hexadecimal (base 16) | CD9D |
| Base 3 | 2200012112 |
| As time | 52637 seconds = 14 h 37 min 17 s |
Is 52637 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 5) | 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 7) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52637 a prime number?
No. 52637 = 13 × 4049, so it is divisible by 13.
What are the factors of 52637?
1, 13, 4049, 52637.
What is 52637 in binary?
1100110110011101 (hexadecimal CD9D, octal 146635).
What is the square root of 52637?
About 229.4275.
Is 52637 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 52637?
52637 is a semiprime: 13 × 4049, the product of two primes.