The number 50962
50962 is a composite number with 8 divisors. Its prime factorisation is 2 × 83 × 307. Divisors (8): 1, 2, 83, 166, 307, 614, 25481, 50962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50962 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50962 is composite. Its prime factorisation is
- 3
The divisors add up to 77616; without 50962 itself that is 26654, so 50962 is deficient (26654 is less than 50962). Euler's totient φ(50962) = 25092 numbers up to 50962 share no factor with it.
- 4
The digits of 50962 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50962 = 2 \times 83 \times 307 \]
50962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 77616 |
| Euler totient φ(n) | 25092 |
| Square | 2597125444 |
| Cube | 132354706877128 |
| Square root | 225.747647 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0962 × |
50962 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and sixty-two |
| Binary (base 2) | 1100011100010010 |
| Octal (base 8) | 143422 |
| Hexadecimal (base 16) | C712 |
| Base 3 | 2120220111 |
| As time | 50962 seconds = 14 h 9 min 22 s |
Is 50962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50962 ÷ 2 = 25481) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 10) | 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 50962 a prime number?
No. 50962 = 2 × 83 × 307, so it is divisible by 2.
What are the factors of 50962?
1, 2, 83, 166, 307, 614, 25481, 50962.
What is 50962 in binary?
1100011100010010 (hexadecimal C712, octal 143422).
What is the square root of 50962?
About 225.7476.
Is 50962 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 50962?
It is a composite number with 8 divisors.