The number 27305
27305 is a composite number with 8 divisors. Its prime factorisation is 5 × 43 × 127. Divisors (8): 1, 5, 43, 127, 215, 635, 5461, 27305.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
27305 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
27305 is composite. Its prime factorisation is
- 3
The divisors add up to 33792; without 27305 itself that is 6487, so 27305 is deficient (6487 is less than 27305). Euler's totient φ(27305) = 21168 numbers up to 27305 share no factor with it.
- 4
The digits of 27305 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 245 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27305 = 5 \times 43 \times 127 \]
27305 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 33792 |
| Euler totient φ(n) | 21168 |
| Square | 745563025 |
| Cube | 20357598397625 |
| Square root | 165.242246 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 245 |
| Scientific notation | 2.7305 × |
27305 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand three hundred and five |
| Binary (base 2) | 110101010101001 |
| Octal (base 8) | 65251 |
| Hexadecimal (base 16) | 6AA9 |
| Base 3 | 1101110022 |
| As time | 27305 seconds = 7 h 35 min 5 s |
Is 27305 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 | No (remainder 2) | 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 | Yes (27305 ÷ 5 = 5461) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 27305 a prime number?
No. 27305 = 5 × 43 × 127, so it is divisible by 5.
What are the factors of 27305?
1, 5, 43, 127, 215, 635, 5461, 27305.
What is 27305 in binary?
110101010101001 (hexadecimal 6AA9, octal 65251).
What is the square root of 27305?
About 165.2422.
Is 27305 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 27305?
It is a composite number with 8 divisors.