The number 15480
15480 is a composite number with 48 divisors. Its prime factorisation is × × 5 × 43. Divisors (48): 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 18, 20, 24, 30, 36 … 15480.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15480: a Harshad number: divisible by its digit sum 18.
- 2
15480 is composite. Its prime factorisation is
- 3
The divisors add up to 51480; without 15480 itself that is 36000, so 15480 is abundant (36000 is more than 15480). Euler's totient φ(15480) = 4032 numbers up to 15480 share no factor with it.
- 4
The digits of 15480 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15480 = 2^{3} \times 3^{2} \times 5 \times 43 \]15480 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 51480 |
| Euler totient φ(n) | 4032 |
| Square | 239630400 |
| Cube | 3709478592000 |
| Square root | 124.418648 (= 6√430) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.548 × |
15480 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand four hundred and eighty |
| Binary (base 2) | 11110001111000 |
| Octal (base 8) | 36170 |
| Hexadecimal (base 16) | 3C78 |
| Base 3 | 210020100 |
| As time | 15480 seconds = 4 h 18 min 0 s |
Is 15480 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15480 ÷ 2 = 7740) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15480 ÷ 3 = 5160) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (15480 ÷ 4 = 3870) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (15480 ÷ 5 = 3096) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15480 ÷ 6 = 2580) | 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 | Yes (15480 ÷ 8 = 1935) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (15480 ÷ 9 = 1720) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15480 ÷ 10 = 1548) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (15480 ÷ 12 = 1290) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15480 a prime number?
No. 15480 = × × 5 × 43, so it is divisible by 2.
What are the factors of 15480?
1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 18, 20, 24, 30, 36, 40, 43, 45, 60, 72, 86, 90, 120, 129, 172, 180, 215, 258, 344, 360, 387, 430, 516, 645, 774, 860, 1032, 1290, 1548, 1720, 1935, 2580, 3096, 3870, 5160, 7740, 15480.
What is 15480 in binary?
11110001111000 (hexadecimal 3C78, octal 36170).
What is the square root of 15480?
About 124.4186, exactly 6√430.
Is 15480 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 15480?
15480 is a Harshad number: divisible by its digit sum 18.