The number 1066
1066 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 41. Divisors (8): 1, 2, 13, 26, 41, 82, 533, 1066.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1066: a Harshad number: divisible by its digit sum 13.
- 2
1066 is composite. Its prime factorisation is
- 3
The divisors add up to 1764; without 1066 itself that is 698, so 1066 is deficient (698 is less than 1066). Euler's totient φ(1066) = 480 numbers up to 1066 share no factor with it.
- 4
The digits of 1066 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1066 = 2 \times 13 \times 41 \]
1066 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 1764 |
| Euler totient φ(n) | 480 |
| Square | 1136356 |
| Cube | 1211355496 |
| Square root | 32.649655 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 31 |
| Scientific notation | 1.066 × |
1066 in other forms
| Form | Value |
|---|---|
| In words | one thousand and sixty-six |
| Roman numerals | MLXVI |
| Binary (base 2) | 10000101010 |
| Octal (base 8) | 2052 |
| Hexadecimal (base 16) | 42A |
| Base 3 | 1110111 |
| As time | 1066 seconds = 17 min 46 s |
Is 1066 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1066 ÷ 2 = 533) | 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 2) | 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 4) | 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 10) | 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 1066 a prime number?
No. 1066 = 2 × 13 × 41, so it is divisible by 2.
What are the factors of 1066?
1, 2, 13, 26, 41, 82, 533, 1066.
What is 1066 in binary?
10000101010 (hexadecimal 42A, octal 2052).
What is the square root of 1066?
About 32.6497.
What is 1066 in Roman numerals?
MLXVI.
Is 1066 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 1066?
1066 is a Harshad number: divisible by its digit sum 13.