The number 53480
53480 is a composite number with 32 divisors. Its prime factorisation is × 5 × 7 × 191. Divisors (32): 1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 56, 70, 140, 191 … 53480.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53480: a Harshad number: divisible by its digit sum 20.
- 2
53480 is composite. Its prime factorisation is
- 3
The divisors add up to 138240; without 53480 itself that is 84760, so 53480 is abundant (84760 is more than 53480). Euler's totient φ(53480) = 18240 numbers up to 53480 share no factor with it.
- 4
The digits of 53480 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53480 = 2^{3} \times 5 \times 7 \times 191 \]53480 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 138240 |
| Euler totient φ(n) | 18240 |
| Square | 2860110400 |
| Cube | 152958704192000 |
| Square root | 231.257432 (= 2√13370) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.348 × |
53480 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand four hundred and eighty |
| Binary (base 2) | 1101000011101000 |
| Octal (base 8) | 150350 |
| Hexadecimal (base 16) | D0E8 |
| Base 3 | 2201100202 |
| As time | 53480 seconds = 14 h 51 min 20 s |
Is 53480 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53480 ÷ 2 = 26740) | 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 | Yes (53480 ÷ 4 = 13370) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (53480 ÷ 5 = 10696) | 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 | Yes (53480 ÷ 7 = 7640) | 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 (53480 ÷ 8 = 6685) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (53480 ÷ 10 = 5348) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53480 a prime number?
No. 53480 = × 5 × 7 × 191, so it is divisible by 2.
What are the factors of 53480?
1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 56, 70, 140, 191, 280, 382, 764, 955, 1337, 1528, 1910, 2674, 3820, 5348, 6685, 7640, 10696, 13370, 26740, 53480.
What is 53480 in binary?
1101000011101000 (hexadecimal D0E8, octal 150350).
What is the square root of 53480?
About 231.2574, exactly 2√13370.
Is 53480 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 53480?
53480 is a Harshad number: divisible by its digit sum 20.