The number 50952
50952 is a composite number with 32 divisors. Its prime factorisation is × 3 × 11 × 193. Divisors (32): 1, 2, 3, 4, 6, 8, 11, 12, 22, 24, 33, 44, 66, 88, 132, 193 … 50952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50952 is composite. Its prime factorisation is
- 3
The divisors add up to 139680; without 50952 itself that is 88728, so 50952 is abundant (88728 is more than 50952). Euler's totient φ(50952) = 15360 numbers up to 50952 share no factor with it.
- 4
The digits of 50952 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 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50952 = 2^{3} \times 3 \times 11 \times 193 \]50952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 139680 |
| Euler totient φ(n) | 15360 |
| Square | 2596106304 |
| Cube | 132276808401408 |
| Square root | 225.725497 (= 2√12738) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0952 × |
50952 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and fifty-two |
| Binary (base 2) | 1100011100001000 |
| Octal (base 8) | 143410 |
| Hexadecimal (base 16) | C708 |
| Base 3 | 2120220010 |
| As time | 50952 seconds = 14 h 9 min 12 s |
Is 50952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50952 ÷ 2 = 25476) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50952 ÷ 3 = 16984) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50952 ÷ 4 = 12738) | 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 (50952 ÷ 6 = 8492) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | Yes (50952 ÷ 8 = 6369) | 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 | Yes (50952 ÷ 11 = 4632) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (50952 ÷ 12 = 4246) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50952 a prime number?
No. 50952 = × 3 × 11 × 193, so it is divisible by 2.
What are the factors of 50952?
1, 2, 3, 4, 6, 8, 11, 12, 22, 24, 33, 44, 66, 88, 132, 193, 264, 386, 579, 772, 1158, 1544, 2123, 2316, 4246, 4632, 6369, 8492, 12738, 16984, 25476, 50952.
What is 50952 in binary?
1100011100001000 (hexadecimal C708, octal 143410).
What is the square root of 50952?
About 225.7255, exactly 2√12738.
Is 50952 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 50952?
It is a composite number with 32 divisors.