The number 51152
51152 is a composite number with 20 divisors. Its prime factorisation is × 23 × 139. Divisors (20): 1, 2, 4, 8, 16, 23, 46, 92, 139, 184, 278, 368, 556, 1112, 2224, 3197 … 51152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51152 is composite. Its prime factorisation is
- 3
The divisors add up to 104160; without 51152 itself that is 53008, so 51152 is abundant (53008 is more than 51152). Euler's totient φ(51152) = 24288 numbers up to 51152 share no factor with it.
- 4
The digits of 51152 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 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51152 = 2^{4} \times 23 \times 139 \]51152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 104160 |
| Euler totient φ(n) | 24288 |
| Square | 2616527104 |
| Cube | 133840594423808 |
| Square root | 226.168079 (= 4√3197) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1152 × |
51152 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and fifty-two |
| Binary (base 2) | 1100011111010000 |
| Octal (base 8) | 143720 |
| Hexadecimal (base 16) | C7D0 |
| Base 3 | 2121011112 |
| As time | 51152 seconds = 14 h 12 min 32 s |
Is 51152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51152 ÷ 2 = 25576) | 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 (51152 ÷ 4 = 12788) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 3) | 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 (51152 ÷ 8 = 6394) | 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 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 51152 a prime number?
No. 51152 = × 23 × 139, so it is divisible by 2.
What are the factors of 51152?
1, 2, 4, 8, 16, 23, 46, 92, 139, 184, 278, 368, 556, 1112, 2224, 3197, 6394, 12788, 25576, 51152.
What is 51152 in binary?
1100011111010000 (hexadecimal C7D0, octal 143720).
What is the square root of 51152?
About 226.1681, exactly 4√3197.
Is 51152 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 51152?
It is a composite number with 20 divisors.