The number 10480
10480 is a composite number with 20 divisors. Its prime factorisation is × 5 × 131. Divisors (20): 1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 131, 262, 524, 655, 1048, 1310 … 10480.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10480 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10480 is composite. Its prime factorisation is
- 3
The divisors add up to 24552; without 10480 itself that is 14072, so 10480 is abundant (14072 is more than 10480). Euler's totient φ(10480) = 4160 numbers up to 10480 share no factor with it.
- 4
The digits of 10480 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 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10480 = 2^{4} \times 5 \times 131 \]10480 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 24552 |
| Euler totient φ(n) | 4160 |
| Square | 109830400 |
| Cube | 1151022592000 |
| Square root | 102.371871 (= 4√655) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 148 |
| Scientific notation | 1.048 × |
10480 in other forms
| Form | Value |
|---|---|
| In words | ten thousand four hundred and eighty |
| Binary (base 2) | 10100011110000 |
| Octal (base 8) | 24360 |
| Hexadecimal (base 16) | 28F0 |
| Base 3 | 112101011 |
| As time | 10480 seconds = 2 h 54 min 40 s |
Is 10480 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10480 ÷ 2 = 5240) | 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 (10480 ÷ 4 = 2620) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (10480 ÷ 5 = 2096) | 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 (10480 ÷ 8 = 1310) | 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 (10480 ÷ 10 = 1048) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 10480 a prime number?
No. 10480 = × 5 × 131, so it is divisible by 2.
What are the factors of 10480?
1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 131, 262, 524, 655, 1048, 1310, 2096, 2620, 5240, 10480.
What is 10480 in binary?
10100011110000 (hexadecimal 28F0, octal 24360).
What is the square root of 10480?
About 102.3719, exactly 4√655.
Is 10480 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 10480?
It is a composite number with 20 divisors.