The number 27330
27330 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 911. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 911, 1822, 2733, 4555, 5466, 9110, 13665, 27330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 27330: a Harshad number: divisible by its digit sum 15.
- 2
27330 is composite. Its prime factorisation is
- 3
The divisors add up to 65664; without 27330 itself that is 38334, so 27330 is abundant (38334 is more than 27330). Euler's totient φ(27330) = 7280 numbers up to 27330 share no factor with it.
- 4
The digits of 27330 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 64 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27330 = 2 \times 3 \times 5 \times 911 \]
27330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 65664 |
| Euler totient φ(n) | 7280 |
| Square | 746928900 |
| Cube | 20413566837000 |
| Square root | 165.317876 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 64 |
| Scientific notation | 2.733 × |
27330 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand three hundred and thirty |
| Binary (base 2) | 110101011000010 |
| Octal (base 8) | 65302 |
| Hexadecimal (base 16) | 6AC2 |
| Base 3 | 1101111020 |
| As time | 27330 seconds = 7 h 35 min 30 s |
Is 27330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (27330 ÷ 2 = 13665) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (27330 ÷ 3 = 9110) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (27330 ÷ 5 = 5466) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (27330 ÷ 6 = 4555) | 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 2) | 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 | Yes (27330 ÷ 10 = 2733) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 27330 a prime number?
No. 27330 = 2 × 3 × 5 × 911, so it is divisible by 2.
What are the factors of 27330?
1, 2, 3, 5, 6, 10, 15, 30, 911, 1822, 2733, 4555, 5466, 9110, 13665, 27330.
What is 27330 in binary?
110101011000010 (hexadecimal 6AC2, octal 65302).
What is the square root of 27330?
About 165.3179.
Is 27330 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 27330?
27330 is a Harshad number: divisible by its digit sum 15.