The number 52190
52190 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 17 × 307. Divisors (16): 1, 2, 5, 10, 17, 34, 85, 170, 307, 614, 1535, 3070, 5219, 10438, 26095, 52190.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52190: a Harshad number: divisible by its digit sum 17.
- 2
52190 is composite. Its prime factorisation is
- 3
The divisors add up to 99792; without 52190 itself that is 47602, so 52190 is deficient (47602 is less than 52190). Euler's totient φ(52190) = 19584 numbers up to 52190 share no factor with it.
- 4
The digits of 52190 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52190 = 2 \times 5 \times 17 \times 307 \]
52190 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 99792 |
| Euler totient φ(n) | 19584 |
| Square | 2723796100 |
| Cube | 142154918459000 |
| Square root | 228.451308 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.219 × |
52190 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand one hundred and ninety |
| Binary (base 2) | 1100101111011110 |
| Octal (base 8) | 145736 |
| Hexadecimal (base 16) | CBDE |
| Base 3 | 2122120222 |
| As time | 52190 seconds = 14 h 29 min 50 s |
Is 52190 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52190 ÷ 2 = 26095) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (52190 ÷ 5 = 10438) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (52190 ÷ 10 = 5219) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52190 a prime number?
No. 52190 = 2 × 5 × 17 × 307, so it is divisible by 2.
What are the factors of 52190?
1, 2, 5, 10, 17, 34, 85, 170, 307, 614, 1535, 3070, 5219, 10438, 26095, 52190.
What is 52190 in binary?
1100101111011110 (hexadecimal CBDE, octal 145736).
What is the square root of 52190?
About 228.4513.
Is 52190 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 52190?
52190 is a Harshad number: divisible by its digit sum 17.