The number 53070
53070 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 29 × 61. Divisors (32): 1, 2, 3, 5, 6, 10, 15, 29, 30, 58, 61, 87, 122, 145, 174, 183 … 53070.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53070: a Harshad number: divisible by its digit sum 15.
- 2
53070 is composite. Its prime factorisation is
- 3
The divisors add up to 133920; without 53070 itself that is 80850, so 53070 is abundant (80850 is more than 53070). Euler's totient φ(53070) = 13440 numbers up to 53070 share no factor with it.
- 4
The digits of 53070 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53070 = 2 \times 3 \times 5 \times 29 \times 61 \]
53070 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 133920 |
| Euler totient φ(n) | 13440 |
| Square | 2816424900 |
| Cube | 149467669443000 |
| Square root | 230.369269 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.307 × |
53070 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and seventy |
| Binary (base 2) | 1100111101001110 |
| Octal (base 8) | 147516 |
| Hexadecimal (base 16) | CF4E |
| Base 3 | 2200210120 |
| As time | 53070 seconds = 14 h 44 min 30 s |
Is 53070 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53070 ÷ 2 = 26535) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (53070 ÷ 3 = 17690) | 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 (53070 ÷ 5 = 10614) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (53070 ÷ 6 = 8845) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (53070 ÷ 10 = 5307) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53070 a prime number?
No. 53070 = 2 × 3 × 5 × 29 × 61, so it is divisible by 2.
What are the factors of 53070?
1, 2, 3, 5, 6, 10, 15, 29, 30, 58, 61, 87, 122, 145, 174, 183, 290, 305, 366, 435, 610, 870, 915, 1769, 1830, 3538, 5307, 8845, 10614, 17690, 26535, 53070.
What is 53070 in binary?
1100111101001110 (hexadecimal CF4E, octal 147516).
What is the square root of 53070?
About 230.3693.
Is 53070 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 53070?
53070 is a Harshad number: divisible by its digit sum 15.