The number 50801
50801 is a composite number with 4 divisors. Its prime factorisation is 37 × 1373. Divisors (4): 1, 37, 1373, 50801.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50801: a semiprime: 37 × 1373, the product of two primes.
- 2
50801 is composite. Its prime factorisation is
- 3
The divisors add up to 52212; without 50801 itself that is 1411, so 50801 is deficient (1411 is less than 50801). Euler's totient φ(50801) = 49392 numbers up to 50801 share no factor with it.
- 4
The digits of 50801 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 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50801 = 37 \times 1373 \]
50801 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52212 |
| Euler totient φ(n) | 49392 |
| Square | 2580741601 |
| Cube | 131104254072401 |
| Square root | 225.390772 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.0801 × |
50801 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand eight hundred and one |
| Binary (base 2) | 1100011001110001 |
| Octal (base 8) | 143161 |
| Hexadecimal (base 16) | C671 |
| Base 3 | 2120200112 |
| As time | 50801 seconds = 14 h 6 min 41 s |
Is 50801 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 2) | 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 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 50801 a prime number?
No. 50801 = 37 × 1373, so it is divisible by 37.
What are the factors of 50801?
1, 37, 1373, 50801.
What is 50801 in binary?
1100011001110001 (hexadecimal C671, octal 143161).
What is the square root of 50801?
About 225.3908.
Is 50801 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50801?
50801 is a semiprime: 37 × 1373, the product of two primes.