The number 50052
50052 is a composite number with 24 divisors. Its prime factorisation is × 3 × 43 × 97. Divisors (24): 1, 2, 3, 4, 6, 12, 43, 86, 97, 129, 172, 194, 258, 291, 388, 516 … 50052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50052: a Harshad number: divisible by its digit sum 12.
- 2
50052 is composite. Its prime factorisation is
- 3
The divisors add up to 120736; without 50052 itself that is 70684, so 50052 is abundant (70684 is more than 50052). Euler's totient φ(50052) = 16128 numbers up to 50052 share no factor with it.
- 4
The digits of 50052 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50052 = 2^{2} \times 3 \times 43 \times 97 \]50052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 120736 |
| Euler totient φ(n) | 16128 |
| Square | 2505202704 |
| Cube | 125390405740608 |
| Square root | 223.723043 (= 2√12513) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 88 |
| Scientific notation | 5.0052 × |
50052 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and fifty-two |
| Binary (base 2) | 1100001110000100 |
| Octal (base 8) | 141604 |
| Hexadecimal (base 16) | C384 |
| Base 3 | 2112122210 |
| As time | 50052 seconds = 13 h 54 min 12 s |
Is 50052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50052 ÷ 2 = 25026) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50052 ÷ 3 = 16684) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50052 ÷ 4 = 12513) | 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 (50052 ÷ 6 = 8342) | 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 4) | 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 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (50052 ÷ 12 = 4171) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50052 a prime number?
No. 50052 = × 3 × 43 × 97, so it is divisible by 2.
What are the factors of 50052?
1, 2, 3, 4, 6, 12, 43, 86, 97, 129, 172, 194, 258, 291, 388, 516, 582, 1164, 4171, 8342, 12513, 16684, 25026, 50052.
What is 50052 in binary?
1100001110000100 (hexadecimal C384, octal 141604).
What is the square root of 50052?
About 223.7230, exactly 2√12513.
Is 50052 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 50052?
50052 is a Harshad number: divisible by its digit sum 12.