The number 51968
51968 is a composite number with 36 divisors. Its prime factorisation is × 7 × 29. Divisors (36): 1, 2, 4, 7, 8, 14, 16, 28, 29, 32, 56, 58, 64, 112, 116, 128 … 51968.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51968: a Harshad number: divisible by its digit sum 29.
- 2
51968 is composite. Its prime factorisation is
- 3
The divisors add up to 122640; without 51968 itself that is 70672, so 51968 is abundant (70672 is more than 51968). Euler's totient φ(51968) = 21504 numbers up to 51968 share no factor with it.
- 4
The digits of 51968 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51968 = 2^{8} \times 7 \times 29 \]51968 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 122640 |
| Euler totient φ(n) | 21504 |
| Square | 2700673024 |
| Cube | 140348575711232 |
| Square root | 227.964910 (= 16√203) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.1968 × |
51968 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand nine hundred and sixty-eight |
| Binary (base 2) | 1100101100000000 |
| Octal (base 8) | 145400 |
| Hexadecimal (base 16) | CB00 |
| Base 3 | 2122021202 |
| As time | 51968 seconds = 14 h 26 min 8 s |
Is 51968 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51968 ÷ 2 = 25984) | 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 (51968 ÷ 4 = 12992) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 | Yes (51968 ÷ 7 = 7424) | 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 (51968 ÷ 8 = 6496) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 51968 a prime number?
No. 51968 = × 7 × 29, so it is divisible by 2.
What are the factors of 51968?
1, 2, 4, 7, 8, 14, 16, 28, 29, 32, 56, 58, 64, 112, 116, 128, 203, 224, 232, 256, 406, 448, 464, 812, 896, 928, 1624, 1792, 1856, 3248, 3712, 6496, 7424, 12992, 25984, 51968.
What is 51968 in binary?
1100101100000000 (hexadecimal CB00, octal 145400).
What is the square root of 51968?
About 227.9649, exactly 16√203.
Is 51968 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 51968?
51968 is a Harshad number: divisible by its digit sum 29.