The number 27671
27671 is a composite number with 8 divisors. Its prime factorisation is 7 × 59 × 67. Divisors (8): 1, 7, 59, 67, 413, 469, 3953, 27671.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 27671: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
27671 is composite. Its prime factorisation is
- 3
The divisors add up to 32640; without 27671 itself that is 4969, so 27671 is deficient (4969 is less than 27671). Euler's totient φ(27671) = 22968 numbers up to 27671 share no factor with it.
- 4
The digits of 27671 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 46 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27671 = 7 \times 59 \times 67 \]
27671 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 32640 |
| Euler totient φ(n) | 22968 |
| Square | 765684241 |
| Cube | 21187248632711 |
| Square root | 166.346025 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 46 |
| Scientific notation | 2.7671 × |
27671 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand six hundred and seventy-one |
| Binary (base 2) | 110110000010111 |
| Octal (base 8) | 66027 |
| Hexadecimal (base 16) | 6C17 |
| Base 3 | 1101221212 |
| As time | 27671 seconds = 7 h 41 min 11 s |
Is 27671 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 3) | 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 | Yes (27671 ÷ 7 = 3953) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 27671 a prime number?
No. 27671 = 7 × 59 × 67, so it is divisible by 7.
What are the factors of 27671?
1, 7, 59, 67, 413, 469, 3953, 27671.
What is 27671 in binary?
110110000010111 (hexadecimal 6C17, octal 66027).
What is the square root of 27671?
About 166.3460.
Is 27671 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 27671?
27671 is a happy number: repeatedly adding the squares of its digits reaches 1.