The number 1660
1660 is a composite number with 12 divisors. Its prime factorisation is × 5 × 83. Divisors (12): 1, 2, 4, 5, 10, 20, 83, 166, 332, 415, 830, 1660.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1660 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1660 is composite. Its prime factorisation is
- 3
The divisors add up to 3528; without 1660 itself that is 1868, so 1660 is abundant (1868 is more than 1660). Euler's totient φ(1660) = 656 numbers up to 1660 share no factor with it.
- 4
The digits of 1660 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 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1660 = 2^{2} \times 5 \times 83 \]1660 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 3528 |
| Euler totient φ(n) | 656 |
| Square | 2755600 |
| Cube | 4574296000 |
| Square root | 40.743098 (= 2√415) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 135 |
| Scientific notation | 1.66 × |
1660 in other forms
| Form | Value |
|---|---|
| In words | one thousand six hundred and sixty |
| Roman numerals | MDCLX |
| Binary (base 2) | 11001111100 |
| Octal (base 8) | 3174 |
| Hexadecimal (base 16) | 67C |
| Base 3 | 2021111 |
| As time | 1660 seconds = 27 min 40 s |
Is 1660 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1660 ÷ 2 = 830) | 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 (1660 ÷ 4 = 415) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (1660 ÷ 5 = 332) | 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 1) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (1660 ÷ 10 = 166) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1660 a prime number?
No. 1660 = × 5 × 83, so it is divisible by 2.
What are the factors of 1660?
1, 2, 4, 5, 10, 20, 83, 166, 332, 415, 830, 1660.
What is 1660 in binary?
11001111100 (hexadecimal 67C, octal 3174).
What is the square root of 1660?
About 40.7431, exactly 2√415.
What is 1660 in Roman numerals?
MDCLX.
Is 1660 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 1660?
It is a composite number with 12 divisors.