The number 50953
50953 is a composite number with 8 divisors. Its prime factorisation is 7 × 29 × 251. Divisors (8): 1, 7, 29, 203, 251, 1757, 7279, 50953.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50953 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50953 is composite. Its prime factorisation is
- 3
The divisors add up to 60480; without 50953 itself that is 9527, so 50953 is deficient (9527 is less than 50953). Euler's totient φ(50953) = 42000 numbers up to 50953 share no factor with it.
- 4
The digits of 50953 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 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50953 = 7 \times 29 \times 251 \]
50953 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 60480 |
| Euler totient φ(n) | 42000 |
| Square | 2596208209 |
| Cube | 132284596873177 |
| Square root | 225.727712 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.0953 × |
50953 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and fifty-three |
| Binary (base 2) | 1100011100001001 |
| Octal (base 8) | 143411 |
| Hexadecimal (base 16) | C709 |
| Base 3 | 2120220011 |
| As time | 50953 seconds = 14 h 9 min 13 s |
Is 50953 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 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50953 ÷ 7 = 7279) | 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50953 a prime number?
No. 50953 = 7 × 29 × 251, so it is divisible by 7.
What are the factors of 50953?
1, 7, 29, 203, 251, 1757, 7279, 50953.
What is 50953 in binary?
1100011100001001 (hexadecimal C709, octal 143411).
What is the square root of 50953?
About 225.7277.
Is 50953 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 50953?
It is a composite number with 8 divisors.