The number 27152
27152 is a composite number with 10 divisors. Its prime factorisation is × 1697. Divisors (10): 1, 2, 4, 8, 16, 1697, 3394, 6788, 13576, 27152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
27152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
27152 is composite. Its prime factorisation is
- 3
The divisors add up to 52638; without 27152 itself that is 25486, so 27152 is deficient (25486 is less than 27152). Euler's totient φ(27152) = 13568 numbers up to 27152 share no factor with it.
- 4
The digits of 27152 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 38 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27152 = 2^{4} \times 1697 \]27152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 52638 |
| Euler totient φ(n) | 13568 |
| Square | 737231104 |
| Cube | 20017298935808 |
| Square root | 164.778639 (= 4√1697) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 38 |
| Scientific notation | 2.7152 × |
27152 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand one hundred and fifty-two |
| Binary (base 2) | 110101000010000 |
| Octal (base 8) | 65020 |
| Hexadecimal (base 16) | 6A10 |
| Base 3 | 1101020122 |
| As time | 27152 seconds = 7 h 32 min 32 s |
Is 27152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (27152 ÷ 2 = 13576) | 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 (27152 ÷ 4 = 6788) | 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 6) | 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 (27152 ÷ 8 = 3394) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 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 27152 a prime number?
No. 27152 = × 1697, so it is divisible by 2.
What are the factors of 27152?
1, 2, 4, 8, 16, 1697, 3394, 6788, 13576, 27152.
What is 27152 in binary?
110101000010000 (hexadecimal 6A10, octal 65020).
What is the square root of 27152?
About 164.7786, exactly 4√1697.
Is 27152 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 27152?
It is a composite number with 10 divisors.