The number 26480
26480 is a composite number with 20 divisors. Its prime factorisation is × 5 × 331. Divisors (20): 1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 331, 662, 1324, 1655, 2648, 3310 … 26480.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 26480: a Harshad number: divisible by its digit sum 20.
- 2
26480 is composite. Its prime factorisation is
- 3
The divisors add up to 61752; without 26480 itself that is 35272, so 26480 is abundant (35272 is more than 26480). Euler's totient φ(26480) = 10560 numbers up to 26480 share no factor with it.
- 4
The digits of 26480 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 46 steps to reach 1.
LaTeX source of the formulas on this page
\[ 26480 = 2^{4} \times 5 \times 331 \]26480 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 61752 |
| Euler totient φ(n) | 10560 |
| Square | 701190400 |
| Cube | 18567521792000 |
| Square root | 162.726765 (= 4√1655) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 46 |
| Scientific notation | 2.648 × |
26480 in other forms
| Form | Value |
|---|---|
| In words | twenty-six thousand four hundred and eighty |
| Binary (base 2) | 110011101110000 |
| Octal (base 8) | 63560 |
| Hexadecimal (base 16) | 6770 |
| Base 3 | 1100022202 |
| As time | 26480 seconds = 7 h 21 min 20 s |
Is 26480 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (26480 ÷ 2 = 13240) | 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 (26480 ÷ 4 = 6620) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (26480 ÷ 5 = 5296) | 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 (26480 ÷ 8 = 3310) | 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 (26480 ÷ 10 = 2648) | 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 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 26480 a prime number?
No. 26480 = × 5 × 331, so it is divisible by 2.
What are the factors of 26480?
1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 331, 662, 1324, 1655, 2648, 3310, 5296, 6620, 13240, 26480.
What is 26480 in binary?
110011101110000 (hexadecimal 6770, octal 63560).
What is the square root of 26480?
About 162.7268, exactly 4√1655.
Is 26480 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 26480?
26480 is a Harshad number: divisible by its digit sum 20.