The number 1671
1671 is a composite number with 4 divisors. Its prime factorisation is 3 × 557. Divisors (4): 1, 3, 557, 1671.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1671: a semiprime: 3 × 557, the product of two primes.
- 2
1671 is composite. Its prime factorisation is
- 3
The divisors add up to 2232; without 1671 itself that is 561, so 1671 is deficient (561 is less than 1671). Euler's totient φ(1671) = 1112 numbers up to 1671 share no factor with it.
- 4
The digits of 1671 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 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1671 = 3 \times 557 \]
1671 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2232 |
| Euler totient φ(n) | 1112 |
| Square | 2792241 |
| Cube | 4665834711 |
| Square root | 40.877867 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.671 × |
1671 in other forms
| Form | Value |
|---|---|
| In words | one thousand six hundred and seventy-one |
| Roman numerals | MDCLXXI |
| Binary (base 2) | 11010000111 |
| Octal (base 8) | 3207 |
| Hexadecimal (base 16) | 687 |
| Base 3 | 2021220 |
| As time | 1671 seconds = 27 min 51 s |
Is 1671 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 (1671 ÷ 3 = 557) | 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 1) | 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 | No (remainder 5) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1671 a prime number?
No. 1671 = 3 × 557, so it is divisible by 3.
What are the factors of 1671?
1, 3, 557, 1671.
What is 1671 in binary?
11010000111 (hexadecimal 687, octal 3207).
What is the square root of 1671?
About 40.8779.
What is 1671 in Roman numerals?
MDCLXXI.
Is 1671 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 1671?
1671 is a semiprime: 3 × 557, the product of two primes.