The number 27561
27561 is a composite number with 4 divisors. Its prime factorisation is 3 × 9187. Divisors (4): 1, 3, 9187, 27561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 27561: a semiprime: 3 × 9187, the product of two primes.
- 2
27561 is composite. Its prime factorisation is
- 3
The divisors add up to 36752; without 27561 itself that is 9191, so 27561 is deficient (9191 is less than 27561). Euler's totient φ(27561) = 18372 numbers up to 27561 share no factor with it.
- 4
The digits of 27561 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 139 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27561 = 3 \times 9187 \]
27561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 36752 |
| Euler totient φ(n) | 18372 |
| Square | 759608721 |
| Cube | 20935575959481 |
| Square root | 166.015060 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 139 |
| Scientific notation | 2.7561 × |
27561 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand five hundred and sixty-one |
| Binary (base 2) | 110101110101001 |
| Octal (base 8) | 65651 |
| Hexadecimal (base 16) | 6BA9 |
| Base 3 | 1101210210 |
| As time | 27561 seconds = 7 h 39 min 21 s |
Is 27561 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (27561 ÷ 3 = 9187) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | No (remainder 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 27561 a prime number?
No. 27561 = 3 × 9187, so it is divisible by 3.
What are the factors of 27561?
1, 3, 9187, 27561.
What is 27561 in binary?
110101110101001 (hexadecimal 6BA9, octal 65651).
What is the square root of 27561?
About 166.0151.
Is 27561 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 27561?
27561 is a semiprime: 3 × 9187, the product of two primes.