The number 11260
11260 is a composite number with 12 divisors. Its prime factorisation is × 5 × 563. Divisors (12): 1, 2, 4, 5, 10, 20, 563, 1126, 2252, 2815, 5630, 11260.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11260: a Harshad number: divisible by its digit sum 10.
- 2
11260 is composite. Its prime factorisation is
- 3
The divisors add up to 23688; without 11260 itself that is 12428, so 11260 is abundant (12428 is more than 11260). Euler's totient φ(11260) = 4496 numbers up to 11260 share no factor with it.
- 4
The digits of 11260 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 161 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11260 = 2^{2} \times 5 \times 563 \]11260 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 23688 |
| Euler totient φ(n) | 4496 |
| Square | 126787600 |
| Cube | 1427628376000 |
| Square root | 106.113147 (= 2√2815) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 161 |
| Scientific notation | 1.126 × |
11260 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand two hundred and sixty |
| Binary (base 2) | 10101111111100 |
| Octal (base 8) | 25774 |
| Hexadecimal (base 16) | 2BFC |
| Base 3 | 120110001 |
| As time | 11260 seconds = 3 h 7 min 40 s |
Is 11260 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11260 ÷ 2 = 5630) | 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 (11260 ÷ 4 = 2815) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (11260 ÷ 5 = 2252) | 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 4) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11260 ÷ 10 = 1126) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11260 a prime number?
No. 11260 = × 5 × 563, so it is divisible by 2.
What are the factors of 11260?
1, 2, 4, 5, 10, 20, 563, 1126, 2252, 2815, 5630, 11260.
What is 11260 in binary?
10101111111100 (hexadecimal 2BFC, octal 25774).
What is the square root of 11260?
About 106.1131, exactly 2√2815.
Is 11260 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 11260?
11260 is a Harshad number: divisible by its digit sum 10.