The number 52050
52050 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 347. Divisors (24): 1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 347, 694, 1041, 1735 … 52050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52050 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52050 is composite. Its prime factorisation is
- 3
The divisors add up to 129456; without 52050 itself that is 77406, so 52050 is abundant (77406 is more than 52050). Euler's totient φ(52050) = 13840 numbers up to 52050 share no factor with it.
- 4
The digits of 52050 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52050 = 2 \times 3 \times 5^{2} \times 347 \]52050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 129456 |
| Euler totient φ(n) | 13840 |
| Square | 2709202500 |
| Cube | 141013990125000 |
| Square root | 228.144691 (= 5√2082) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.205 × |
52050 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand and fifty |
| Binary (base 2) | 1100101101010010 |
| Octal (base 8) | 145522 |
| Hexadecimal (base 16) | CB52 |
| Base 3 | 2122101210 |
| As time | 52050 seconds = 14 h 27 min 30 s |
Is 52050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52050 ÷ 2 = 26025) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (52050 ÷ 3 = 17350) | 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 (52050 ÷ 5 = 10410) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (52050 ÷ 6 = 8675) | 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 2) | 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 (52050 ÷ 10 = 5205) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 52050 a prime number?
No. 52050 = 2 × 3 × × 347, so it is divisible by 2.
What are the factors of 52050?
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 347, 694, 1041, 1735, 2082, 3470, 5205, 8675, 10410, 17350, 26025, 52050.
What is 52050 in binary?
1100101101010010 (hexadecimal CB52, octal 145522).
What is the square root of 52050?
About 228.1447, exactly 5√2082.
Is 52050 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 52050?
It is a composite number with 24 divisors.