The number 1662
1662 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 277. Divisors (8): 1, 2, 3, 6, 277, 554, 831, 1662.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1662 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1662 is composite. Its prime factorisation is
- 3
The divisors add up to 3336; without 1662 itself that is 1674, so 1662 is abundant (1674 is more than 1662). Euler's totient φ(1662) = 552 numbers up to 1662 share no factor with it.
- 4
The digits of 1662 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 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1662 = 2 \times 3 \times 277 \]
1662 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 3336 |
| Euler totient φ(n) | 552 |
| Square | 2762244 |
| Cube | 4590849528 |
| Square root | 40.767634 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 135 |
| Scientific notation | 1.662 × |
1662 in other forms
| Form | Value |
|---|---|
| In words | one thousand six hundred and sixty-two |
| Roman numerals | MDCLXII |
| Binary (base 2) | 11001111110 |
| Octal (base 8) | 3176 |
| Hexadecimal (base 16) | 67E |
| Base 3 | 2021120 |
| As time | 1662 seconds = 27 min 42 s |
Is 1662 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1662 ÷ 2 = 831) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1662 ÷ 3 = 554) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (1662 ÷ 6 = 277) | 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 6) | 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 2) | 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 1662 a prime number?
No. 1662 = 2 × 3 × 277, so it is divisible by 2.
What are the factors of 1662?
1, 2, 3, 6, 277, 554, 831, 1662.
What is 1662 in binary?
11001111110 (hexadecimal 67E, octal 3176).
What is the square root of 1662?
About 40.7676.
What is 1662 in Roman numerals?
MDCLXII.
Is 1662 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 1662?
It is a composite number with 8 divisors.