The number 50852
50852 is a composite number with 6 divisors. Its prime factorisation is × 12713. Divisors (6): 1, 2, 4, 12713, 25426, 50852.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50852 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50852 is composite. Its prime factorisation is
- 3
The divisors add up to 88998; without 50852 itself that is 38146, so 50852 is deficient (38146 is less than 50852). Euler's totient φ(50852) = 25424 numbers up to 50852 share no factor with it.
- 4
The digits of 50852 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50852 = 2^{2} \times 12713 \]50852 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 88998 |
| Euler totient φ(n) | 25424 |
| Square | 2585925904 |
| Cube | 131499504070208 |
| Square root | 225.503880 (= 2√12713) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0852 × |
50852 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand eight hundred and fifty-two |
| Binary (base 2) | 1100011010100100 |
| Octal (base 8) | 143244 |
| Hexadecimal (base 16) | C6A4 |
| Base 3 | 2120202102 |
| As time | 50852 seconds = 14 h 7 min 32 s |
Is 50852 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50852 ÷ 2 = 25426) | 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 | Yes (50852 ÷ 4 = 12713) | 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 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50852 a prime number?
No. 50852 = × 12713, so it is divisible by 2.
What are the factors of 50852?
1, 2, 4, 12713, 25426, 50852.
What is 50852 in binary?
1100011010100100 (hexadecimal C6A4, octal 143244).
What is the square root of 50852?
About 225.5039, exactly 2√12713.
Is 50852 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50852?
It is a composite number with 6 divisors.