The number 52590
52590 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1753. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1753, 3506, 5259, 8765, 10518, 17530, 26295, 52590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52590 is composite. Its prime factorisation is
- 3
The divisors add up to 126288; without 52590 itself that is 73698, so 52590 is abundant (73698 is more than 52590). Euler's totient φ(52590) = 14016 numbers up to 52590 share no factor with it.
- 4
The digits of 52590 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52590 = 2 \times 3 \times 5 \times 1753 \]
52590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 126288 |
| Euler totient φ(n) | 14016 |
| Square | 2765708100 |
| Cube | 145448588979000 |
| Square root | 229.325097 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.259 × |
52590 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand five hundred and ninety |
| Binary (base 2) | 1100110101101110 |
| Octal (base 8) | 146556 |
| Hexadecimal (base 16) | CD6E |
| Base 3 | 2200010210 |
| As time | 52590 seconds = 14 h 36 min 30 s |
Is 52590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52590 ÷ 2 = 26295) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (52590 ÷ 3 = 17530) | 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 | Yes (52590 ÷ 5 = 10518) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (52590 ÷ 6 = 8765) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (52590 ÷ 10 = 5259) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52590 a prime number?
No. 52590 = 2 × 3 × 5 × 1753, so it is divisible by 2.
What are the factors of 52590?
1, 2, 3, 5, 6, 10, 15, 30, 1753, 3506, 5259, 8765, 10518, 17530, 26295, 52590.
What is 52590 in binary?
1100110101101110 (hexadecimal CD6E, octal 146556).
What is the square root of 52590?
About 229.3251.
Is 52590 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 52590?
It is a composite number with 16 divisors.