The number 50362
50362 is a composite number with 12 divisors. Its prime factorisation is 2 × × 149. Divisors (12): 1, 2, 13, 26, 149, 169, 298, 338, 1937, 3874, 25181, 50362.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50362 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50362 is composite. Its prime factorisation is
- 3
The divisors add up to 82350; without 50362 itself that is 31988, so 50362 is deficient (31988 is less than 50362). Euler's totient φ(50362) = 23088 numbers up to 50362 share no factor with it.
- 4
The digits of 50362 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50362 = 2 \times 13^{2} \times 149 \]50362 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 82350 |
| Euler totient φ(n) | 23088 |
| Square | 2536331044 |
| Cube | 127734704037928 |
| Square root | 224.414795 (= 13√298) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.0362 × |
50362 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and sixty-two |
| Binary (base 2) | 1100010010111010 |
| Octal (base 8) | 142272 |
| Hexadecimal (base 16) | C4BA |
| Base 3 | 2120002021 |
| As time | 50362 seconds = 13 h 59 min 22 s |
Is 50362 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50362 ÷ 2 = 25181) | 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 4) | 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 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 4) | 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 50362 a prime number?
No. 50362 = 2 × × 149, so it is divisible by 2.
What are the factors of 50362?
1, 2, 13, 26, 149, 169, 298, 338, 1937, 3874, 25181, 50362.
What is 50362 in binary?
1100010010111010 (hexadecimal C4BA, octal 142272).
What is the square root of 50362?
About 224.4148, exactly 13√298.
Is 50362 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50362?
It is a composite number with 12 divisors.