The number 61152
61152 is a composite number with 72 divisors. Its prime factorisation is × 3 × × 13. Divisors (72): 1, 2, 3, 4, 6, 7, 8, 12, 13, 14, 16, 21, 24, 26, 28, 32 … 61152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61152 is composite. Its prime factorisation is
- 3
The divisors add up to 201096; without 61152 itself that is 139944, so 61152 is abundant (139944 is more than 61152). Euler's totient φ(61152) = 16128 numbers up to 61152 share no factor with it.
- 4
The digits of 61152 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61152 = 2^{5} \times 3 \times 7^{2} \times 13 \]61152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 72 |
| Sum of divisors | 201096 |
| Euler totient φ(n) | 16128 |
| Square | 3739567104 |
| Cube | 228682007543808 |
| Square root | 247.289304 (= 28√78) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 34 |
| Scientific notation | 6.1152 × |
61152 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand one hundred and fifty-two |
| Binary (base 2) | 1110111011100000 |
| Octal (base 8) | 167340 |
| Hexadecimal (base 16) | EEE0 |
| Base 3 | 10002212220 |
| As time | 61152 seconds = 16 h 59 min 12 s |
Is 61152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61152 ÷ 2 = 30576) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (61152 ÷ 3 = 20384) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (61152 ÷ 4 = 15288) | 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 | Yes (61152 ÷ 6 = 10192) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (61152 ÷ 7 = 8736) | 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 (61152 ÷ 8 = 7644) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (61152 ÷ 12 = 5096) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61152 a prime number?
No. 61152 = × 3 × × 13, so it is divisible by 2.
What are the factors of 61152?
1, 2, 3, 4, 6, 7, 8, 12, 13, 14, 16, 21, 24, 26, 28, 32, 39, 42, 48, 49, 52, 56, 78, 84, 91, 96, 98, 104, 112, 147, 156, 168, 182, 196, 208, 224, 273, 294, 312, 336, 364, 392, 416, 546, 588, 624, 637, 672, 728, 784, 1092, 1176, 1248, 1274, 1456, 1568, 1911, 2184, 2352, 2548, 2912, 3822, 4368, 4704, 5096, 7644, 8736, 10192, 15288, 20384, 30576, 61152.
What is 61152 in binary?
1110111011100000 (hexadecimal EEE0, octal 167340).
What is the square root of 61152?
About 247.2893, exactly 28√78.
Is 61152 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 61152?
It is a composite number with 72 divisors.