The number 51280
51280 is a composite number with 20 divisors. Its prime factorisation is × 5 × 641. Divisors (20): 1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 641, 1282, 2564, 3205, 5128, 6410 … 51280.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51280: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 16.
- 2
51280 is composite. Its prime factorisation is
- 3
The divisors add up to 119412; without 51280 itself that is 68132, so 51280 is abundant (68132 is more than 51280). Euler's totient φ(51280) = 20480 numbers up to 51280 share no factor with it.
- 4
The digits of 51280 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51280 = 2^{4} \times 5 \times 641 \]51280 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 119412 |
| Euler totient φ(n) | 20480 |
| Square | 2629638400 |
| Cube | 134847857152000 |
| Square root | 226.450878 (= 4√3205) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.128 × |
51280 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and eighty |
| Binary (base 2) | 1100100001010000 |
| Octal (base 8) | 144120 |
| Hexadecimal (base 16) | C850 |
| Base 3 | 2121100021 |
| As time | 51280 seconds = 14 h 14 min 40 s |
Is 51280 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51280 ÷ 2 = 25640) | 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 (51280 ÷ 4 = 12820) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (51280 ÷ 5 = 10256) | 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 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 | Yes (51280 ÷ 8 = 6410) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (51280 ÷ 10 = 5128) | 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 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51280 a prime number?
No. 51280 = × 5 × 641, so it is divisible by 2.
What are the factors of 51280?
1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 641, 1282, 2564, 3205, 5128, 6410, 10256, 12820, 25640, 51280.
What is 51280 in binary?
1100100001010000 (hexadecimal C850, octal 144120).
What is the square root of 51280?
About 226.4509, exactly 4√3205.
Is 51280 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 51280?
51280 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 16.