The number 51052
51052 is a composite number with 6 divisors. Its prime factorisation is × 12763. Divisors (6): 1, 2, 4, 12763, 25526, 51052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51052 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51052 is composite. Its prime factorisation is
- 3
The divisors add up to 89348; without 51052 itself that is 38296, so 51052 is deficient (38296 is less than 51052). Euler's totient φ(51052) = 25524 numbers up to 51052 share no factor with it.
- 4
The digits of 51052 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51052 = 2^{2} \times 12763 \]51052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 89348 |
| Euler totient φ(n) | 25524 |
| Square | 2606306704 |
| Cube | 133057169852608 |
| Square root | 225.946896 (= 2√12763) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1052 × |
51052 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and fifty-two |
| Binary (base 2) | 1100011101101100 |
| Octal (base 8) | 143554 |
| Hexadecimal (base 16) | C76C |
| Base 3 | 2121000211 |
| As time | 51052 seconds = 14 h 10 min 52 s |
Is 51052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51052 ÷ 2 = 25526) | 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 | Yes (51052 ÷ 4 = 12763) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 4) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51052 a prime number?
No. 51052 = × 12763, so it is divisible by 2.
What are the factors of 51052?
1, 2, 4, 12763, 25526, 51052.
What is 51052 in binary?
1100011101101100 (hexadecimal C76C, octal 143554).
What is the square root of 51052?
About 225.9469, exactly 2√12763.
Is 51052 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 51052?
It is a composite number with 6 divisors.