The number 27051
27051 is a composite number with 8 divisors. Its prime factorisation is 3 × 71 × 127. Divisors (8): 1, 3, 71, 127, 213, 381, 9017, 27051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 27051: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
27051 is composite. Its prime factorisation is
- 3
The divisors add up to 36864; without 27051 itself that is 9813, so 27051 is deficient (9813 is less than 27051). Euler's totient φ(27051) = 17640 numbers up to 27051 share no factor with it.
- 4
The digits of 27051 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
\[ 27051 = 3 \times 71 \times 127 \]
27051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 36864 |
| Euler totient φ(n) | 17640 |
| Square | 731756601 |
| Cube | 19794747813651 |
| Square root | 164.471882 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 90 |
| Scientific notation | 2.7051 × |
27051 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand and fifty-one |
| Binary (base 2) | 110100110101011 |
| Octal (base 8) | 64653 |
| Hexadecimal (base 16) | 69AB |
| Base 3 | 1101002220 |
| As time | 27051 seconds = 7 h 30 min 51 s |
Is 27051 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 (27051 ÷ 3 = 9017) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | 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 3) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 27051 a prime number?
No. 27051 = 3 × 71 × 127, so it is divisible by 3.
What are the factors of 27051?
1, 3, 71, 127, 213, 381, 9017, 27051.
What is 27051 in binary?
110100110101011 (hexadecimal 69AB, octal 64653).
What is the square root of 27051?
About 164.4719.
Is 27051 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 27051?
27051 is a happy number: repeatedly adding the squares of its digits reaches 1.