The number 15520
15520 is a composite number with 24 divisors. Its prime factorisation is × 5 × 97. Divisors (24): 1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 80, 97, 160, 194, 388, 485 … 15520.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15520 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15520 is composite. Its prime factorisation is
- 3
The divisors add up to 37044; without 15520 itself that is 21524, so 15520 is abundant (21524 is more than 15520). Euler's totient φ(15520) = 6144 numbers up to 15520 share no factor with it.
- 4
The digits of 15520 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15520 = 2^{5} \times 5 \times 97 \]15520 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 37044 |
| Euler totient φ(n) | 6144 |
| Square | 240870400 |
| Cube | 3738308608000 |
| Square root | 124.579292 (= 4√970) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 102 |
| Scientific notation | 1.552 × |
15520 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand five hundred and twenty |
| Binary (base 2) | 11110010100000 |
| Octal (base 8) | 36240 |
| Hexadecimal (base 16) | 3CA0 |
| Base 3 | 210021211 |
| As time | 15520 seconds = 4 h 18 min 40 s |
Is 15520 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15520 ÷ 2 = 7760) | 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 (15520 ÷ 4 = 3880) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (15520 ÷ 5 = 3104) | 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 1) | 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 (15520 ÷ 8 = 1940) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15520 ÷ 10 = 1552) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 15520 a prime number?
No. 15520 = × 5 × 97, so it is divisible by 2.
What are the factors of 15520?
1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 80, 97, 160, 194, 388, 485, 776, 970, 1552, 1940, 3104, 3880, 7760, 15520.
What is 15520 in binary?
11110010100000 (hexadecimal 3CA0, octal 36240).
What is the square root of 15520?
About 124.5793, exactly 4√970.
Is 15520 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 15520?
It is a composite number with 24 divisors.