The number 53010
53010 is a composite number with 48 divisors. Its prime factorisation is 2 × × 5 × 19 × 31. Divisors (48): 1, 2, 3, 5, 6, 9, 10, 15, 18, 19, 30, 31, 38, 45, 57, 62 … 53010.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53010: a Harshad number: divisible by its digit sum 9.
- 2
53010 is composite. Its prime factorisation is
- 3
The divisors add up to 149760; without 53010 itself that is 96750, so 53010 is abundant (96750 is more than 53010). Euler's totient φ(53010) = 12960 numbers up to 53010 share no factor with it.
- 4
The digits of 53010 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53010 = 2 \times 3^{2} \times 5 \times 19 \times 31 \]53010 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 149760 |
| Euler totient φ(n) | 12960 |
| Square | 2810060100 |
| Cube | 148961285901000 |
| Square root | 230.239006 (= 3√5890) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.301 × |
53010 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and ten |
| Binary (base 2) | 1100111100010010 |
| Octal (base 8) | 147422 |
| Hexadecimal (base 16) | CF12 |
| Base 3 | 2200201100 |
| As time | 53010 seconds = 14 h 43 min 30 s |
Is 53010 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53010 ÷ 2 = 26505) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (53010 ÷ 3 = 17670) | 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 (53010 ÷ 5 = 10602) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (53010 ÷ 6 = 8835) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | Yes (53010 ÷ 9 = 5890) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (53010 ÷ 10 = 5301) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 53010 a prime number?
No. 53010 = 2 × × 5 × 19 × 31, so it is divisible by 2.
What are the factors of 53010?
1, 2, 3, 5, 6, 9, 10, 15, 18, 19, 30, 31, 38, 45, 57, 62, 90, 93, 95, 114, 155, 171, 186, 190, 279, 285, 310, 342, 465, 558, 570, 589, 855, 930, 1178, 1395, 1710, 1767, 2790, 2945, 3534, 5301, 5890, 8835, 10602, 17670, 26505, 53010.
What is 53010 in binary?
1100111100010010 (hexadecimal CF12, octal 147422).
What is the square root of 53010?
About 230.2390, exactly 3√5890.
Is 53010 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 53010?
53010 is a Harshad number: divisible by its digit sum 9.