The number 51260
51260 is a composite number with 24 divisors. Its prime factorisation is × 5 × 11 × 233. Divisors (24): 1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110, 220, 233, 466, 932, 1165 … 51260.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51260 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51260 is composite. Its prime factorisation is
- 3
The divisors add up to 117936; without 51260 itself that is 66676, so 51260 is abundant (66676 is more than 51260). Euler's totient φ(51260) = 18560 numbers up to 51260 share no factor with it.
- 4
The digits of 51260 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51260 = 2^{2} \times 5 \times 11 \times 233 \]51260 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 117936 |
| Euler totient φ(n) | 18560 |
| Square | 2627587600 |
| Cube | 134690140376000 |
| Square root | 226.406714 (= 2√12815) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.126 × |
51260 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and sixty |
| Binary (base 2) | 1100100000111100 |
| Octal (base 8) | 144074 |
| Hexadecimal (base 16) | C83C |
| Base 3 | 2121022112 |
| As time | 51260 seconds = 14 h 14 min 20 s |
Is 51260 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51260 ÷ 2 = 25630) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (51260 ÷ 4 = 12815) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (51260 ÷ 5 = 10252) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (51260 ÷ 10 = 5126) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (51260 ÷ 11 = 4660) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51260 a prime number?
No. 51260 = × 5 × 11 × 233, so it is divisible by 2.
What are the factors of 51260?
1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110, 220, 233, 466, 932, 1165, 2330, 2563, 4660, 5126, 10252, 12815, 25630, 51260.
What is 51260 in binary?
1100100000111100 (hexadecimal C83C, octal 144074).
What is the square root of 51260?
About 226.4067, exactly 2√12815.
Is 51260 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 51260?
It is a composite number with 24 divisors.