The number 5480
5480 is a composite number with 16 divisors. Its prime factorisation is × 5 × 137. Divisors (16): 1, 2, 4, 5, 8, 10, 20, 40, 137, 274, 548, 685, 1096, 1370, 2740, 5480.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5480 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5480 is composite. Its prime factorisation is
- 3
The divisors add up to 12420; without 5480 itself that is 6940, so 5480 is abundant (6940 is more than 5480). Euler's totient φ(5480) = 2176 numbers up to 5480 share no factor with it.
- 4
The digits of 5480 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 129 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5480 = 2^{3} \times 5 \times 137 \]5480 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 12420 |
| Euler totient φ(n) | 2176 |
| Square | 30030400 |
| Cube | 164566592000 |
| Square root | 74.027022 (= 2√1370) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 129 |
| Scientific notation | 5.48 × |
5480 in other forms
| Form | Value |
|---|---|
| In words | five thousand four hundred and eighty |
| Binary (base 2) | 1010101101000 |
| Octal (base 8) | 12550 |
| Hexadecimal (base 16) | 1568 |
| Base 3 | 21111222 |
| As time | 5480 seconds = 1 h 31 min 20 s |
Is 5480 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5480 ÷ 2 = 2740) | 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 (5480 ÷ 4 = 1370) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (5480 ÷ 5 = 1096) | 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 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 (5480 ÷ 8 = 685) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (5480 ÷ 10 = 548) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 5480 a prime number?
No. 5480 = × 5 × 137, so it is divisible by 2.
What are the factors of 5480?
1, 2, 4, 5, 8, 10, 20, 40, 137, 274, 548, 685, 1096, 1370, 2740, 5480.
What is 5480 in binary?
1010101101000 (hexadecimal 1568, octal 12550).
What is the square root of 5480?
About 74.0270, exactly 2√1370.
Is 5480 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 5480?
It is a composite number with 16 divisors.