The number 57671
57671 is a composite number with 4 divisors. Its prime factorisation is 101 × 571. Divisors (4): 1, 101, 571, 57671.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 57671: a semiprime: 101 × 571, the product of two primes.
- 2
57671 is composite. Its prime factorisation is
- 3
The divisors add up to 58344; without 57671 itself that is 673, so 57671 is deficient (673 is less than 57671). Euler's totient φ(57671) = 57000 numbers up to 57671 share no factor with it.
- 4
The digits of 57671 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 197 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57671 = 101 \times 571 \]
57671 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 58344 |
| Euler totient φ(n) | 57000 |
| Square | 3325944241 |
| Cube | 191810530322711 |
| Square root | 240.147871 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 197 |
| Scientific notation | 5.7671 × |
57671 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand six hundred and seventy-one |
| Binary (base 2) | 1110000101000111 |
| Octal (base 8) | 160507 |
| Hexadecimal (base 16) | E147 |
| Base 3 | 2221002222 |
| As time | 57671 seconds = 16 h 1 min 11 s |
Is 57671 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 | No (remainder 5) | 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 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 9) | 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 57671 a prime number?
No. 57671 = 101 × 571, so it is divisible by 101.
What are the factors of 57671?
1, 101, 571, 57671.
What is 57671 in binary?
1110000101000111 (hexadecimal E147, octal 160507).
What is the square root of 57671?
About 240.1479.
Is 57671 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 57671?
57671 is a semiprime: 101 × 571, the product of two primes.