The number 641
641 is a twin prime (641 and 643 are both prime) and the 116th prime number. Its only divisors are 1 and 641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 641: a twin prime (641 and 643 are both prime); the 116th prime number.
- 2
641 is prime, so its only factors are 1 and 641. It is the 116th prime; the next prime is 643 and the one before is 631.
- 3
The divisors add up to 642; without 641 itself that is 1, so 641 is deficient (1 is less than 641). Euler's totient φ(641) = 640 numbers up to 641 share no factor with it.
- 4
The digits of 641 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 51 steps to reach 1.
641 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 642 |
| Euler totient φ(n) | 640 |
| Square | 410881 |
| Cube | 263374721 |
| Square root | 25.317978 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 51 |
| Scientific notation | 6.41 × |
641 in other forms
| Form | Value |
|---|---|
| In words | six hundred and forty-one |
| Roman numerals | DCXLI |
| Binary (base 2) | 1010000001 |
| Octal (base 8) | 1201 |
| Hexadecimal (base 16) | 281 |
| Base 3 | 212202 |
| As time | 641 seconds = 10 min 41 s |
Is 641 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 2) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 641 a prime number?
Yes. 641 is divisible only by 1 and itself.
What are the factors of 641?
1, 641.
What is 641 in binary?
1010000001 (hexadecimal 281, octal 1201).
What is the square root of 641?
About 25.3180.
What is 641 in Roman numerals?
DCXLI.
Is 641 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 641?
641 is a twin prime (641 and 643 are both prime); the 116th prime number.