The number 50641
50641 is a composite number with 4 divisors. Its prime factorisation is 89 × 569. Divisors (4): 1, 89, 569, 50641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50641: a semiprime: 89 × 569, the product of two primes.
- 2
50641 is composite. Its prime factorisation is
- 3
The divisors add up to 51300; without 50641 itself that is 659, so 50641 is deficient (659 is less than 50641). Euler's totient φ(50641) = 49984 numbers up to 50641 share no factor with it.
- 4
The digits of 50641 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50641 = 89 \times 569 \]
50641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51300 |
| Euler totient φ(n) | 49984 |
| Square | 2564510881 |
| Cube | 129869395524721 |
| Square root | 225.035553 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0641 × |
50641 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and forty-one |
| Binary (base 2) | 1100010111010001 |
| Octal (base 8) | 142721 |
| Hexadecimal (base 16) | C5D1 |
| Base 3 | 2120110121 |
| As time | 50641 seconds = 14 h 4 min 1 s |
Is 50641 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 1) | 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 1) | 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 7) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50641 a prime number?
No. 50641 = 89 × 569, so it is divisible by 89.
What are the factors of 50641?
1, 89, 569, 50641.
What is 50641 in binary?
1100010111010001 (hexadecimal C5D1, octal 142721).
What is the square root of 50641?
About 225.0356.
Is 50641 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50641?
50641 is a semiprime: 89 × 569, the product of two primes.