The number 51252
51252 is a composite number with 12 divisors. Its prime factorisation is × 3 × 4271. Divisors (12): 1, 2, 3, 4, 6, 12, 4271, 8542, 12813, 17084, 25626, 51252.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51252 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51252 is composite. Its prime factorisation is
- 3
The divisors add up to 119616; without 51252 itself that is 68364, so 51252 is abundant (68364 is more than 51252). Euler's totient φ(51252) = 17080 numbers up to 51252 share no factor with it.
- 4
The digits of 51252 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51252 = 2^{2} \times 3 \times 4271 \]51252 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 119616 |
| Euler totient φ(n) | 17080 |
| Square | 2626767504 |
| Cube | 134627088115008 |
| Square root | 226.389046 (= 2√12813) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.1252 × |
51252 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and fifty-two |
| Binary (base 2) | 1100100000110100 |
| Octal (base 8) | 144064 |
| Hexadecimal (base 16) | C834 |
| Base 3 | 2121022020 |
| As time | 51252 seconds = 14 h 14 min 12 s |
Is 51252 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51252 ÷ 2 = 25626) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51252 ÷ 3 = 17084) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (51252 ÷ 4 = 12813) | 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 (51252 ÷ 6 = 8542) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 6) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (51252 ÷ 12 = 4271) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51252 a prime number?
No. 51252 = × 3 × 4271, so it is divisible by 2.
What are the factors of 51252?
1, 2, 3, 4, 6, 12, 4271, 8542, 12813, 17084, 25626, 51252.
What is 51252 in binary?
1100100000110100 (hexadecimal C834, octal 144064).
What is the square root of 51252?
About 226.3890, exactly 2√12813.
Is 51252 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 51252?
It is a composite number with 12 divisors.