The number 1655
1655 is a composite number with 4 divisors. Its prime factorisation is 5 × 331. Divisors (4): 1, 5, 331, 1655.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1655: a semiprime: 5 × 331, the product of two primes.
- 2
1655 is composite. Its prime factorisation is
- 3
The divisors add up to 1992; without 1655 itself that is 337, so 1655 is deficient (337 is less than 1655). Euler's totient φ(1655) = 1320 numbers up to 1655 share no factor with it.
- 4
The digits of 1655 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1655 = 5 \times 331 \]
1655 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1992 |
| Euler totient φ(n) | 1320 |
| Square | 2739025 |
| Cube | 4533086375 |
| Square root | 40.681691 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.655 × |
1655 in other forms
| Form | Value |
|---|---|
| In words | one thousand six hundred and fifty-five |
| Roman numerals | MDCLV |
| Binary (base 2) | 11001110111 |
| Octal (base 8) | 3167 |
| Hexadecimal (base 16) | 677 |
| Base 3 | 2021022 |
| As time | 1655 seconds = 27 min 35 s |
Is 1655 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 | No (remainder 2) | 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 | Yes (1655 ÷ 5 = 331) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1655 a prime number?
No. 1655 = 5 × 331, so it is divisible by 5.
What are the factors of 1655?
1, 5, 331, 1655.
What is 1655 in binary?
11001110111 (hexadecimal 677, octal 3167).
What is the square root of 1655?
About 40.6817.
What is 1655 in Roman numerals?
MDCLV.
Is 1655 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 1655?
1655 is a semiprime: 5 × 331, the product of two primes.