The number 51056
51056 is a composite number with 10 divisors. Its prime factorisation is × 3191. Divisors (10): 1, 2, 4, 8, 16, 3191, 6382, 12764, 25528, 51056.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51056 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51056 is composite. Its prime factorisation is
- 3
The divisors add up to 98952; without 51056 itself that is 47896, so 51056 is deficient (47896 is less than 51056). Euler's totient φ(51056) = 25520 numbers up to 51056 share no factor with it.
- 4
The digits of 51056 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51056 = 2^{4} \times 3191 \]51056 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 98952 |
| Euler totient φ(n) | 25520 |
| Square | 2606715136 |
| Cube | 133088447983616 |
| Square root | 225.955748 (= 4√3191) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1056 × |
51056 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and fifty-six |
| Binary (base 2) | 1100011101110000 |
| Octal (base 8) | 143560 |
| Hexadecimal (base 16) | C770 |
| Base 3 | 2121000222 |
| As time | 51056 seconds = 14 h 10 min 56 s |
Is 51056 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51056 ÷ 2 = 25528) | 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 (51056 ÷ 4 = 12764) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 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 (51056 ÷ 8 = 6382) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 51056 a prime number?
No. 51056 = × 3191, so it is divisible by 2.
What are the factors of 51056?
1, 2, 4, 8, 16, 3191, 6382, 12764, 25528, 51056.
What is 51056 in binary?
1100011101110000 (hexadecimal C770, octal 143560).
What is the square root of 51056?
About 225.9557, exactly 4√3191.
Is 51056 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 51056?
It is a composite number with 10 divisors.