The number 27157
27157 is a composite number with 4 divisors. Its prime factorisation is 13 × 2089. Divisors (4): 1, 13, 2089, 27157.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 27157: a semiprime: 13 × 2089, the product of two primes.
- 2
27157 is composite. Its prime factorisation is
- 3
The divisors add up to 29260; without 27157 itself that is 2103, so 27157 is deficient (2103 is less than 27157). Euler's totient φ(27157) = 25056 numbers up to 27157 share no factor with it.
- 4
The digits of 27157 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 38 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27157 = 13 \times 2089 \]
27157 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 29260 |
| Euler totient φ(n) | 25056 |
| Square | 737502649 |
| Cube | 20028359438893 |
| Square root | 164.793811 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 38 |
| Scientific notation | 2.7157 × |
27157 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand one hundred and fifty-seven |
| Binary (base 2) | 110101000010101 |
| Octal (base 8) | 65025 |
| Hexadecimal (base 16) | 6A15 |
| Base 3 | 1101020211 |
| As time | 27157 seconds = 7 h 32 min 37 s |
Is 27157 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 27157 a prime number?
No. 27157 = 13 × 2089, so it is divisible by 13.
What are the factors of 27157?
1, 13, 2089, 27157.
What is 27157 in binary?
110101000010101 (hexadecimal 6A15, octal 65025).
What is the square root of 27157?
About 164.7938.
Is 27157 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 27157?
27157 is a semiprime: 13 × 2089, the product of two primes.