The number 27406
27406 is a composite number with 8 divisors. Its prime factorisation is 2 × 71 × 193. Divisors (8): 1, 2, 71, 142, 193, 386, 13703, 27406.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
27406 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
27406 is composite. Its prime factorisation is
- 3
The divisors add up to 41904; without 27406 itself that is 14498, so 27406 is deficient (14498 is less than 27406). Euler's totient φ(27406) = 13440 numbers up to 27406 share no factor with it.
- 4
The digits of 27406 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 59 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27406 = 2 \times 71 \times 193 \]
27406 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 41904 |
| Euler totient φ(n) | 13440 |
| Square | 751088836 |
| Cube | 20584340639416 |
| Square root | 165.547576 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 59 |
| Scientific notation | 2.7406 × |
27406 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand four hundred and six |
| Binary (base 2) | 110101100001110 |
| Octal (base 8) | 65416 |
| Hexadecimal (base 16) | 6B0E |
| Base 3 | 1101121001 |
| As time | 27406 seconds = 7 h 36 min 46 s |
Is 27406 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (27406 ÷ 2 = 13703) | 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 2) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 27406 a prime number?
No. 27406 = 2 × 71 × 193, so it is divisible by 2.
What are the factors of 27406?
1, 2, 71, 142, 193, 386, 13703, 27406.
What is 27406 in binary?
110101100001110 (hexadecimal 6B0E, octal 65416).
What is the square root of 27406?
About 165.5476.
Is 27406 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 27406?
It is a composite number with 8 divisors.