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