The number 1266
1266 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 211. Divisors (8): 1, 2, 3, 6, 211, 422, 633, 1266.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1266 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1266 is composite. Its prime factorisation is
- 3
The divisors add up to 2544; without 1266 itself that is 1278, so 1266 is abundant (1278 is more than 1266). Euler's totient φ(1266) = 420 numbers up to 1266 share no factor with it.
- 4
The digits of 1266 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1266 = 2 \times 3 \times 211 \]
1266 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2544 |
| Euler totient φ(n) | 420 |
| Square | 1602756 |
| Cube | 2029089096 |
| Square root | 35.580894 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 31 |
| Scientific notation | 1.266 × |
1266 in other forms
| Form | Value |
|---|---|
| In words | one thousand two hundred and sixty-six |
| Roman numerals | MCCLXVI |
| Binary (base 2) | 10011110010 |
| Octal (base 8) | 2362 |
| Hexadecimal (base 16) | 4F2 |
| Base 3 | 1201220 |
| As time | 1266 seconds = 21 min 6 s |
Is 1266 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1266 ÷ 2 = 633) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1266 ÷ 3 = 422) | 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 | Yes (1266 ÷ 6 = 211) | 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 | No (remainder 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1266 a prime number?
No. 1266 = 2 × 3 × 211, so it is divisible by 2.
What are the factors of 1266?
1, 2, 3, 6, 211, 422, 633, 1266.
What is 1266 in binary?
10011110010 (hexadecimal 4F2, octal 2362).
What is the square root of 1266?
About 35.5809.
What is 1266 in Roman numerals?
MCCLXVI.
Is 1266 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 1266?
It is a composite number with 8 divisors.