The number 27341
27341 is a composite number with 4 divisors. Its prime factorisation is 19 × 1439. Divisors (4): 1, 19, 1439, 27341.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 27341: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 19 × 1439, the product of two primes.
- 2
27341 is composite. Its prime factorisation is
- 3
The divisors add up to 28800; without 27341 itself that is 1459, so 27341 is deficient (1459 is less than 27341). Euler's totient φ(27341) = 25884 numbers up to 27341 share no factor with it.
- 4
The digits of 27341 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 59 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27341 = 19 \times 1439 \]
27341 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 28800 |
| Euler totient φ(n) | 25884 |
| Square | 747530281 |
| Cube | 20438225412821 |
| Square root | 165.351142 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 59 |
| Scientific notation | 2.7341 × |
27341 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand three hundred and forty-one |
| Binary (base 2) | 110101011001101 |
| Octal (base 8) | 65315 |
| Hexadecimal (base 16) | 6ACD |
| Base 3 | 1101111122 |
| As time | 27341 seconds = 7 h 35 min 41 s |
Is 27341 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 | No (remainder 1) | 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 6) | 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 8) | 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 6) | 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 27341 a prime number?
No. 27341 = 19 × 1439, so it is divisible by 19.
What are the factors of 27341?
1, 19, 1439, 27341.
What is 27341 in binary?
110101011001101 (hexadecimal 6ACD, octal 65315).
What is the square root of 27341?
About 165.3511.
Is 27341 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 27341?
27341 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 19 × 1439, the product of two primes.