The number 1641
1641 is a composite number with 4 divisors. Its prime factorisation is 3 × 547. Divisors (4): 1, 3, 547, 1641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1641: a semiprime: 3 × 547, the product of two primes.
- 2
1641 is composite. Its prime factorisation is
- 3
The divisors add up to 2192; without 1641 itself that is 551, so 1641 is deficient (551 is less than 1641). Euler's totient φ(1641) = 1092 numbers up to 1641 share no factor with it.
- 4
The digits of 1641 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1641 = 3 \times 547 \]
1641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2192 |
| Euler totient φ(n) | 1092 |
| Square | 2692881 |
| Cube | 4419017721 |
| Square root | 40.509258 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 73 |
| Scientific notation | 1.641 × |
1641 in other forms
| Form | Value |
|---|---|
| In words | one thousand six hundred and forty-one |
| Roman numerals | MDCXLI |
| Binary (base 2) | 11001101001 |
| Octal (base 8) | 3151 |
| Hexadecimal (base 16) | 669 |
| Base 3 | 2020210 |
| As time | 1641 seconds = 27 min 21 s |
Is 1641 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 (1641 ÷ 3 = 547) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1641 a prime number?
No. 1641 = 3 × 547, so it is divisible by 3.
What are the factors of 1641?
1, 3, 547, 1641.
What is 1641 in binary?
11001101001 (hexadecimal 669, octal 3151).
What is the square root of 1641?
About 40.5093.
What is 1641 in Roman numerals?
MDCXLI.
Is 1641 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 1641?
1641 is a semiprime: 3 × 547, the product of two primes.