The number 50902
50902 is a composite number with 8 divisors. Its prime factorisation is 2 × 31 × 821. Divisors (8): 1, 2, 31, 62, 821, 1642, 25451, 50902.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50902 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50902 is composite. Its prime factorisation is
- 3
The divisors add up to 78912; without 50902 itself that is 28010, so 50902 is deficient (28010 is less than 50902). Euler's totient φ(50902) = 24600 numbers up to 50902 share no factor with it.
- 4
The digits of 50902 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 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50902 = 2 \times 31 \times 821 \]
50902 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 78912 |
| Euler totient φ(n) | 24600 |
| Square | 2591013604 |
| Cube | 131887774470808 |
| Square root | 225.614716 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.0902 × |
50902 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and two |
| Binary (base 2) | 1100011011010110 |
| Octal (base 8) | 143326 |
| Hexadecimal (base 16) | C6D6 |
| Base 3 | 2120211021 |
| As time | 50902 seconds = 14 h 8 min 22 s |
Is 50902 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50902 ÷ 2 = 25451) | 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 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 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 6) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50902 a prime number?
No. 50902 = 2 × 31 × 821, so it is divisible by 2.
What are the factors of 50902?
1, 2, 31, 62, 821, 1642, 25451, 50902.
What is 50902 in binary?
1100011011010110 (hexadecimal C6D6, octal 143326).
What is the square root of 50902?
About 225.6147.
Is 50902 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50902?
It is a composite number with 8 divisors.