The number 1659
1659 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 79. Divisors (8): 1, 3, 7, 21, 79, 237, 553, 1659.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1659: a Harshad number: divisible by its digit sum 21.
- 2
1659 is composite. Its prime factorisation is
- 3
The divisors add up to 2560; without 1659 itself that is 901, so 1659 is deficient (901 is less than 1659). Euler's totient φ(1659) = 936 numbers up to 1659 share no factor with it.
- 4
The digits of 1659 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1659 = 3 \times 7 \times 79 \]
1659 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2560 |
| Euler totient φ(n) | 936 |
| Square | 2752281 |
| Cube | 4566034179 |
| Square root | 40.730824 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.659 × |
1659 in other forms
| Form | Value |
|---|---|
| In words | one thousand six hundred and fifty-nine |
| Roman numerals | MDCLIX |
| Binary (base 2) | 11001111011 |
| Octal (base 8) | 3173 |
| Hexadecimal (base 16) | 67B |
| Base 3 | 2021110 |
| As time | 1659 seconds = 27 min 39 s |
Is 1659 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1659 ÷ 3 = 553) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (1659 ÷ 7 = 237) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1659 a prime number?
No. 1659 = 3 × 7 × 79, so it is divisible by 3.
What are the factors of 1659?
1, 3, 7, 21, 79, 237, 553, 1659.
What is 1659 in binary?
11001111011 (hexadecimal 67B, octal 3173).
What is the square root of 1659?
About 40.7308.
What is 1659 in Roman numerals?
MDCLIX.
Is 1659 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 1659?
1659 is a Harshad number: divisible by its digit sum 21.