The number 50681
50681 is a composite number with 4 divisors. Its prime factorisation is 59 × 859. Divisors (4): 1, 59, 859, 50681.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50681: a semiprime: 59 × 859, the product of two primes.
- 2
50681 is composite. Its prime factorisation is
- 3
The divisors add up to 51600; without 50681 itself that is 919, so 50681 is deficient (919 is less than 50681). Euler's totient φ(50681) = 49764 numbers up to 50681 share no factor with it.
- 4
The digits of 50681 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50681 = 59 \times 859 \]
50681 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51600 |
| Euler totient φ(n) | 49764 |
| Square | 2568563761 |
| Cube | 130177379971241 |
| Square root | 225.124410 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0681 × |
50681 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and eighty-one |
| Binary (base 2) | 1100010111111001 |
| Octal (base 8) | 142771 |
| Hexadecimal (base 16) | C5F9 |
| Base 3 | 2120112002 |
| As time | 50681 seconds = 14 h 4 min 41 s |
Is 50681 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 1) | 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 4) | 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 50681 a prime number?
No. 50681 = 59 × 859, so it is divisible by 59.
What are the factors of 50681?
1, 59, 859, 50681.
What is 50681 in binary?
1100010111111001 (hexadecimal C5F9, octal 142771).
What is the square root of 50681?
About 225.1244.
Is 50681 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50681?
50681 is a semiprime: 59 × 859, the product of two primes.