The number 11266
11266 is a composite number with 8 divisors. Its prime factorisation is 2 × 43 × 131. Divisors (8): 1, 2, 43, 86, 131, 262, 5633, 11266.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11266 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11266 is composite. Its prime factorisation is
- 3
The divisors add up to 17424; without 11266 itself that is 6158, so 11266 is deficient (6158 is less than 11266). Euler's totient φ(11266) = 5460 numbers up to 11266 share no factor with it.
- 4
The digits of 11266 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11266 = 2 \times 43 \times 131 \]
11266 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17424 |
| Euler totient φ(n) | 5460 |
| Square | 126922756 |
| Cube | 1429911769096 |
| Square root | 106.141415 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 60 |
| Scientific notation | 1.1266 × |
11266 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand two hundred and sixty-six |
| Binary (base 2) | 10110000000010 |
| Octal (base 8) | 26002 |
| Hexadecimal (base 16) | 2C02 |
| Base 3 | 120110021 |
| As time | 11266 seconds = 3 h 7 min 46 s |
Is 11266 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11266 ÷ 2 = 5633) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 3) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11266 a prime number?
No. 11266 = 2 × 43 × 131, so it is divisible by 2.
What are the factors of 11266?
1, 2, 43, 86, 131, 262, 5633, 11266.
What is 11266 in binary?
10110000000010 (hexadecimal 2C02, octal 26002).
What is the square root of 11266?
About 106.1414.
Is 11266 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 11266?
It is a composite number with 8 divisors.