The number 52070
52070 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 41 × 127. Divisors (16): 1, 2, 5, 10, 41, 82, 127, 205, 254, 410, 635, 1270, 5207, 10414, 26035, 52070.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52070 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52070 is composite. Its prime factorisation is
- 3
The divisors add up to 96768; without 52070 itself that is 44698, so 52070 is deficient (44698 is less than 52070). Euler's totient φ(52070) = 20160 numbers up to 52070 share no factor with it.
- 4
The digits of 52070 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52070 = 2 \times 5 \times 41 \times 127 \]
52070 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 96768 |
| Euler totient φ(n) | 20160 |
| Square | 2711284900 |
| Cube | 141176604743000 |
| Square root | 228.188519 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.207 × |
52070 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand and seventy |
| Binary (base 2) | 1100101101100110 |
| Octal (base 8) | 145546 |
| Hexadecimal (base 16) | CB66 |
| Base 3 | 2122102112 |
| As time | 52070 seconds = 14 h 27 min 50 s |
Is 52070 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52070 ÷ 2 = 26035) | 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 (52070 ÷ 5 = 10414) | 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 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 6) | 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 | Yes (52070 ÷ 10 = 5207) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 52070 a prime number?
No. 52070 = 2 × 5 × 41 × 127, so it is divisible by 2.
What are the factors of 52070?
1, 2, 5, 10, 41, 82, 127, 205, 254, 410, 635, 1270, 5207, 10414, 26035, 52070.
What is 52070 in binary?
1100101101100110 (hexadecimal CB66, octal 145546).
What is the square root of 52070?
About 228.1885.
Is 52070 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 52070?
It is a composite number with 16 divisors.