The number 50081
50081 is a composite number with 4 divisors. Its prime factorisation is 61 × 821. Divisors (4): 1, 61, 821, 50081.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50081: a semiprime: 61 × 821, the product of two primes.
- 2
50081 is composite. Its prime factorisation is
- 3
The divisors add up to 50964; without 50081 itself that is 883, so 50081 is deficient (883 is less than 50081). Euler's totient φ(50081) = 49200 numbers up to 50081 share no factor with it.
- 4
The digits of 50081 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50081 = 61 \times 821 \]
50081 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50964 |
| Euler totient φ(n) | 49200 |
| Square | 2508106561 |
| Cube | 125608484681441 |
| Square root | 223.787846 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0081 × |
50081 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and eighty-one |
| Binary (base 2) | 1100001110100001 |
| Octal (base 8) | 141641 |
| Hexadecimal (base 16) | C3A1 |
| Base 3 | 2112200212 |
| As time | 50081 seconds = 13 h 54 min 41 s |
Is 50081 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 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 5) | 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 9) | 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 50081 a prime number?
No. 50081 = 61 × 821, so it is divisible by 61.
What are the factors of 50081?
1, 61, 821, 50081.
What is 50081 in binary?
1100001110100001 (hexadecimal C3A1, octal 141641).
What is the square root of 50081?
About 223.7878.
Is 50081 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50081?
50081 is a semiprime: 61 × 821, the product of two primes.