The number 52390
52390 is a composite number with 24 divisors. Its prime factorisation is 2 × 5 × × 31. Divisors (24): 1, 2, 5, 10, 13, 26, 31, 62, 65, 130, 155, 169, 310, 338, 403, 806 … 52390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52390 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52390 is composite. Its prime factorisation is
- 3
The divisors add up to 105408; without 52390 itself that is 53018, so 52390 is abundant (53018 is more than 52390). Euler's totient φ(52390) = 18720 numbers up to 52390 share no factor with it.
- 4
The digits of 52390 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52390 = 2 \times 5 \times 13^{2} \times 31 \]52390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 105408 |
| Euler totient φ(n) | 18720 |
| Square | 2744712100 |
| Cube | 143795466919000 |
| Square root | 228.888619 (= 13√310) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.239 × |
52390 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand three hundred and ninety |
| Binary (base 2) | 1100110010100110 |
| Octal (base 8) | 146246 |
| Hexadecimal (base 16) | CCA6 |
| Base 3 | 2122212101 |
| As time | 52390 seconds = 14 h 33 min 10 s |
Is 52390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52390 ÷ 2 = 26195) | 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 | Yes (52390 ÷ 5 = 10478) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (52390 ÷ 10 = 5239) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 52390 a prime number?
No. 52390 = 2 × 5 × × 31, so it is divisible by 2.
What are the factors of 52390?
1, 2, 5, 10, 13, 26, 31, 62, 65, 130, 155, 169, 310, 338, 403, 806, 845, 1690, 2015, 4030, 5239, 10478, 26195, 52390.
What is 52390 in binary?
1100110010100110 (hexadecimal CCA6, octal 146246).
What is the square root of 52390?
About 228.8886, exactly 13√310.
Is 52390 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 52390?
It is a composite number with 24 divisors.