The number 27141
27141 is a composite number with 8 divisors. Its prime factorisation is 3 × 83 × 109. Divisors (8): 1, 3, 83, 109, 249, 327, 9047, 27141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
27141 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
27141 is composite. Its prime factorisation is
- 3
The divisors add up to 36960; without 27141 itself that is 9819, so 27141 is deficient (9819 is less than 27141). Euler's totient φ(27141) = 17712 numbers up to 27141 share no factor with it.
- 4
The digits of 27141 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 90 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27141 = 3 \times 83 \times 109 \]
27141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 36960 |
| Euler totient φ(n) | 17712 |
| Square | 736633881 |
| Cube | 19992980164221 |
| Square root | 164.745258 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 90 |
| Scientific notation | 2.7141 × |
27141 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand one hundred and forty-one |
| Binary (base 2) | 110101000000101 |
| Octal (base 8) | 65005 |
| Hexadecimal (base 16) | 6A05 |
| Base 3 | 1101020020 |
| As time | 27141 seconds = 7 h 32 min 21 s |
Is 27141 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 (27141 ÷ 3 = 9047) | 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 5) | 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 1) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 27141 a prime number?
No. 27141 = 3 × 83 × 109, so it is divisible by 3.
What are the factors of 27141?
1, 3, 83, 109, 249, 327, 9047, 27141.
What is 27141 in binary?
110101000000101 (hexadecimal 6A05, octal 65005).
What is the square root of 27141?
About 164.7453.
Is 27141 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 27141?
It is a composite number with 8 divisors.