The number 27237
27237 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 1297. Divisors (8): 1, 3, 7, 21, 1297, 3891, 9079, 27237.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 27237: a Harshad number: divisible by its digit sum 21.
- 2
27237 is composite. Its prime factorisation is
- 3
The divisors add up to 41536; without 27237 itself that is 14299, so 27237 is deficient (14299 is less than 27237). Euler's totient φ(27237) = 15552 numbers up to 27237 share no factor with it.
- 4
The digits of 27237 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 183 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27237 = 3 \times 7 \times 1297 \]
27237 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 41536 |
| Euler totient φ(n) | 15552 |
| Square | 741854169 |
| Cube | 20205882001053 |
| Square root | 165.036360 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 183 |
| Scientific notation | 2.7237 × |
27237 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand two hundred and thirty-seven |
| Binary (base 2) | 110101001100101 |
| Octal (base 8) | 65145 |
| Hexadecimal (base 16) | 6A65 |
| Base 3 | 1101100210 |
| As time | 27237 seconds = 7 h 33 min 57 s |
Is 27237 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 (27237 ÷ 3 = 9079) | 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 2) | 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 | Yes (27237 ÷ 7 = 3891) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 27237 a prime number?
No. 27237 = 3 × 7 × 1297, so it is divisible by 3.
What are the factors of 27237?
1, 3, 7, 21, 1297, 3891, 9079, 27237.
What is 27237 in binary?
110101001100101 (hexadecimal 6A65, octal 65145).
What is the square root of 27237?
About 165.0364.
Is 27237 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 27237?
27237 is a Harshad number: divisible by its digit sum 21.