The number 51536
51536 is a composite number with 10 divisors. Its prime factorisation is × 3221. Divisors (10): 1, 2, 4, 8, 16, 3221, 6442, 12884, 25768, 51536.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51536 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51536 is composite. Its prime factorisation is
- 3
The divisors add up to 99882; without 51536 itself that is 48346, so 51536 is deficient (48346 is less than 51536). Euler's totient φ(51536) = 25760 numbers up to 51536 share no factor with it.
- 4
The digits of 51536 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 26 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51536 = 2^{4} \times 3221 \]51536 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 99882 |
| Euler totient φ(n) | 25760 |
| Square | 2655959296 |
| Cube | 136877518278656 |
| Square root | 227.015418 (= 4√3221) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 26 |
| Scientific notation | 5.1536 × |
51536 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and thirty-six |
| Binary (base 2) | 1100100101010000 |
| Octal (base 8) | 144520 |
| Hexadecimal (base 16) | C950 |
| Base 3 | 2121200202 |
| As time | 51536 seconds = 14 h 18 min 56 s |
Is 51536 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51536 ÷ 2 = 25768) | 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 (51536 ÷ 4 = 12884) | 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 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 | Yes (51536 ÷ 8 = 6442) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 1) | 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 51536 a prime number?
No. 51536 = × 3221, so it is divisible by 2.
What are the factors of 51536?
1, 2, 4, 8, 16, 3221, 6442, 12884, 25768, 51536.
What is 51536 in binary?
1100100101010000 (hexadecimal C950, octal 144520).
What is the square root of 51536?
About 227.0154, exactly 4√3221.
Is 51536 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 51536?
It is a composite number with 10 divisors.