The number 50862
50862 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 173. Divisors (24): 1, 2, 3, 6, 7, 14, 21, 42, 49, 98, 147, 173, 294, 346, 519, 1038 … 50862.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50862: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.
- 2
50862 is composite. Its prime factorisation is
- 3
The divisors add up to 119016; without 50862 itself that is 68154, so 50862 is abundant (68154 is more than 50862). Euler's totient φ(50862) = 14448 numbers up to 50862 share no factor with it.
- 4
The digits of 50862 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50862 = 2 \times 3 \times 7^{2} \times 173 \]50862 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 119016 |
| Euler totient φ(n) | 14448 |
| Square | 2586943044 |
| Cube | 131577097103928 |
| Square root | 225.526052 (= 7√1038) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 57 |
| Scientific notation | 5.0862 × |
50862 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand eight hundred and sixty-two |
| Binary (base 2) | 1100011010101110 |
| Octal (base 8) | 143256 |
| Hexadecimal (base 16) | C6AE |
| Base 3 | 2120202210 |
| As time | 50862 seconds = 14 h 7 min 42 s |
Is 50862 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50862 ÷ 2 = 25431) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50862 ÷ 3 = 16954) | 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 (50862 ÷ 6 = 8477) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50862 ÷ 7 = 7266) | 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 3) | 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 9) | 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 50862 a prime number?
No. 50862 = 2 × 3 × × 173, so it is divisible by 2.
What are the factors of 50862?
1, 2, 3, 6, 7, 14, 21, 42, 49, 98, 147, 173, 294, 346, 519, 1038, 1211, 2422, 3633, 7266, 8477, 16954, 25431, 50862.
What is 50862 in binary?
1100011010101110 (hexadecimal C6AE, octal 143256).
What is the square root of 50862?
About 225.5261, exactly 7√1038.
Is 50862 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 50862?
50862 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.