The number 53080
53080 is a composite number with 16 divisors. Its prime factorisation is × 5 × 1327. Divisors (16): 1, 2, 4, 5, 8, 10, 20, 40, 1327, 2654, 5308, 6635, 10616, 13270, 26540, 53080.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53080 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53080 is composite. Its prime factorisation is
- 3
The divisors add up to 119520; without 53080 itself that is 66440, so 53080 is abundant (66440 is more than 53080). Euler's totient φ(53080) = 21216 numbers up to 53080 share no factor with it.
- 4
The digits of 53080 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53080 = 2^{3} \times 5 \times 1327 \]53080 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 119520 |
| Euler totient φ(n) | 21216 |
| Square | 2817486400 |
| Cube | 149552178112000 |
| Square root | 230.390972 (= 2√13270) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.308 × |
53080 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and eighty |
| Binary (base 2) | 1100111101011000 |
| Octal (base 8) | 147530 |
| Hexadecimal (base 16) | CF58 |
| Base 3 | 2200210221 |
| As time | 53080 seconds = 14 h 44 min 40 s |
Is 53080 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53080 ÷ 2 = 26540) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (53080 ÷ 4 = 13270) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (53080 ÷ 5 = 10616) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 | Yes (53080 ÷ 8 = 6635) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (53080 ÷ 10 = 5308) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53080 a prime number?
No. 53080 = × 5 × 1327, so it is divisible by 2.
What are the factors of 53080?
1, 2, 4, 5, 8, 10, 20, 40, 1327, 2654, 5308, 6635, 10616, 13270, 26540, 53080.
What is 53080 in binary?
1100111101011000 (hexadecimal CF58, octal 147530).
What is the square root of 53080?
About 230.3910, exactly 2√13270.
Is 53080 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 53080?
It is a composite number with 16 divisors.