The number 51060
51060 is a composite number with 48 divisors. Its prime factorisation is × 3 × 5 × 23 × 37. Divisors (48): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 23, 30, 37, 46, 60, 69 … 51060.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51060: a Harshad number: divisible by its digit sum 12.
- 2
51060 is composite. Its prime factorisation is
- 3
The divisors add up to 153216; without 51060 itself that is 102156, so 51060 is abundant (102156 is more than 51060). Euler's totient φ(51060) = 12672 numbers up to 51060 share no factor with it.
- 4
The digits of 51060 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 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51060 = 2^{2} \times 3 \times 5 \times 23 \times 37 \]51060 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 153216 |
| Euler totient φ(n) | 12672 |
| Square | 2607123600 |
| Cube | 133119731016000 |
| Square root | 225.964599 (= 2√12765) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.106 × |
51060 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and sixty |
| Binary (base 2) | 1100011101110100 |
| Octal (base 8) | 143564 |
| Hexadecimal (base 16) | C774 |
| Base 3 | 2121001010 |
| As time | 51060 seconds = 14 h 11 min 0 s |
Is 51060 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51060 ÷ 2 = 25530) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51060 ÷ 3 = 17020) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (51060 ÷ 4 = 12765) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (51060 ÷ 5 = 10212) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (51060 ÷ 6 = 8510) | 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 | Yes (51060 ÷ 10 = 5106) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (51060 ÷ 12 = 4255) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51060 a prime number?
No. 51060 = × 3 × 5 × 23 × 37, so it is divisible by 2.
What are the factors of 51060?
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 23, 30, 37, 46, 60, 69, 74, 92, 111, 115, 138, 148, 185, 222, 230, 276, 345, 370, 444, 460, 555, 690, 740, 851, 1110, 1380, 1702, 2220, 2553, 3404, 4255, 5106, 8510, 10212, 12765, 17020, 25530, 51060.
What is 51060 in binary?
1100011101110100 (hexadecimal C774, octal 143564).
What is the square root of 51060?
About 225.9646, exactly 2√12765.
Is 51060 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 51060?
51060 is a Harshad number: divisible by its digit sum 12.