The number 11480
11480 is a composite number with 32 divisors. Its prime factorisation is × 5 × 7 × 41. Divisors (32): 1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 41, 56, 70, 82 … 11480.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11480: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 14.
- 2
11480 is composite. Its prime factorisation is
- 3
The divisors add up to 30240; without 11480 itself that is 18760, so 11480 is abundant (18760 is more than 11480). Euler's totient φ(11480) = 3840 numbers up to 11480 share no factor with it.
- 4
The digits of 11480 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11480 = 2^{3} \times 5 \times 7 \times 41 \]11480 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 30240 |
| Euler totient φ(n) | 3840 |
| Square | 131790400 |
| Cube | 1512953792000 |
| Square root | 107.144762 (= 2√2870) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.148 × |
11480 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and eighty |
| Binary (base 2) | 10110011011000 |
| Octal (base 8) | 26330 |
| Hexadecimal (base 16) | 2CD8 |
| Base 3 | 120202012 |
| As time | 11480 seconds = 3 h 11 min 20 s |
Is 11480 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11480 ÷ 2 = 5740) | 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 (11480 ÷ 4 = 2870) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (11480 ÷ 5 = 2296) | 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 | Yes (11480 ÷ 7 = 1640) | 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 (11480 ÷ 8 = 1435) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11480 ÷ 10 = 1148) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 11480 a prime number?
No. 11480 = × 5 × 7 × 41, so it is divisible by 2.
What are the factors of 11480?
1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 41, 56, 70, 82, 140, 164, 205, 280, 287, 328, 410, 574, 820, 1148, 1435, 1640, 2296, 2870, 5740, 11480.
What is 11480 in binary?
10110011011000 (hexadecimal 2CD8, octal 26330).
What is the square root of 11480?
About 107.1448, exactly 2√2870.
Is 11480 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 11480?
11480 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 14.