The number 50963
50963 is a composite number with 8 divisors. Its prime factorisation is 11 × 41 × 113. Divisors (8): 1, 11, 41, 113, 451, 1243, 4633, 50963.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50963 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50963 is composite. Its prime factorisation is
- 3
The divisors add up to 57456; without 50963 itself that is 6493, so 50963 is deficient (6493 is less than 50963). Euler's totient φ(50963) = 44800 numbers up to 50963 share no factor with it.
- 4
The digits of 50963 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50963 = 11 \times 41 \times 113 \]
50963 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 57456 |
| Euler totient φ(n) | 44800 |
| Square | 2597227369 |
| Cube | 132362498406347 |
| Square root | 225.749862 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0963 × |
50963 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and sixty-three |
| Binary (base 2) | 1100011100010011 |
| Octal (base 8) | 143423 |
| Hexadecimal (base 16) | C713 |
| Base 3 | 2120220112 |
| As time | 50963 seconds = 14 h 9 min 23 s |
Is 50963 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (50963 ÷ 11 = 4633) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50963 a prime number?
No. 50963 = 11 × 41 × 113, so it is divisible by 11.
What are the factors of 50963?
1, 11, 41, 113, 451, 1243, 4633, 50963.
What is 50963 in binary?
1100011100010011 (hexadecimal C713, octal 143423).
What is the square root of 50963?
About 225.7499.
Is 50963 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 50963?
It is a composite number with 8 divisors.