The number 27552
27552 is a composite number with 48 divisors. Its prime factorisation is × 3 × 7 × 41. Divisors (48): 1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 21, 24, 28, 32, 41, 42 … 27552.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 27552: a Harshad number: divisible by its digit sum 21.
- 2
27552 is composite. Its prime factorisation is
- 3
The divisors add up to 84672; without 27552 itself that is 57120, so 27552 is abundant (57120 is more than 27552). Euler's totient φ(27552) = 7680 numbers up to 27552 share no factor with it.
- 4
The digits of 27552 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 108 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27552 = 2^{5} \times 3 \times 7 \times 41 \]27552 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 84672 |
| Euler totient φ(n) | 7680 |
| Square | 759112704 |
| Cube | 20915073220608 |
| Square root | 165.987951 (= 4√1722) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 108 |
| Scientific notation | 2.7552 × |
27552 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand five hundred and fifty-two |
| Binary (base 2) | 110101110100000 |
| Octal (base 8) | 65640 |
| Hexadecimal (base 16) | 6BA0 |
| Base 3 | 1101210110 |
| As time | 27552 seconds = 7 h 39 min 12 s |
Is 27552 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (27552 ÷ 2 = 13776) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (27552 ÷ 3 = 9184) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (27552 ÷ 4 = 6888) | 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 (27552 ÷ 6 = 4592) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (27552 ÷ 7 = 3936) | 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 (27552 ÷ 8 = 3444) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (27552 ÷ 12 = 2296) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 27552 a prime number?
No. 27552 = × 3 × 7 × 41, so it is divisible by 2.
What are the factors of 27552?
1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 21, 24, 28, 32, 41, 42, 48, 56, 82, 84, 96, 112, 123, 164, 168, 224, 246, 287, 328, 336, 492, 574, 656, 672, 861, 984, 1148, 1312, 1722, 1968, 2296, 3444, 3936, 4592, 6888, 9184, 13776, 27552.
What is 27552 in binary?
110101110100000 (hexadecimal 6BA0, octal 65640).
What is the square root of 27552?
About 165.9880, exactly 4√1722.
Is 27552 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 27552?
27552 is a Harshad number: divisible by its digit sum 21.