The number 50802
50802 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 8467. Divisors (8): 1, 2, 3, 6, 8467, 16934, 25401, 50802.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50802 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50802 is composite. Its prime factorisation is
- 3
The divisors add up to 101616; without 50802 itself that is 50814, so 50802 is abundant (50814 is more than 50802). Euler's totient φ(50802) = 16932 numbers up to 50802 share no factor with it.
- 4
The digits of 50802 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50802 = 2 \times 3 \times 8467 \]
50802 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 101616 |
| Euler totient φ(n) | 16932 |
| Square | 2580843204 |
| Cube | 131111996449608 |
| Square root | 225.392990 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.0802 × |
50802 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand eight hundred and two |
| Binary (base 2) | 1100011001110010 |
| Octal (base 8) | 143162 |
| Hexadecimal (base 16) | C672 |
| Base 3 | 2120200120 |
| As time | 50802 seconds = 14 h 6 min 42 s |
Is 50802 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50802 ÷ 2 = 25401) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50802 ÷ 3 = 16934) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50802 ÷ 6 = 8467) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50802 a prime number?
No. 50802 = 2 × 3 × 8467, so it is divisible by 2.
What are the factors of 50802?
1, 2, 3, 6, 8467, 16934, 25401, 50802.
What is 50802 in binary?
1100011001110010 (hexadecimal C672, octal 143162).
What is the square root of 50802?
About 225.3930.
Is 50802 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50802?
It is a composite number with 8 divisors.