The number 57971
57971 is a composite number with 4 divisors. Its prime factorisation is 29 × 1999. Divisors (4): 1, 29, 1999, 57971.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 57971: a Harshad number: divisible by its digit sum 29; a semiprime: 29 × 1999, the product of two primes.
- 2
57971 is composite. Its prime factorisation is
- 3
The divisors add up to 60000; without 57971 itself that is 2029, so 57971 is deficient (2029 is less than 57971). Euler's totient φ(57971) = 55944 numbers up to 57971 share no factor with it.
- 4
The digits of 57971 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57971 = 29 \times 1999 \]
57971 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60000 |
| Euler totient φ(n) | 55944 |
| Square | 3360636841 |
| Cube | 194819478309611 |
| Square root | 240.771676 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 179 |
| Scientific notation | 5.7971 × |
57971 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand nine hundred and seventy-one |
| Binary (base 2) | 1110001001110011 |
| Octal (base 8) | 161163 |
| Hexadecimal (base 16) | E273 |
| Base 3 | 2221112002 |
| As time | 57971 seconds = 16 h 6 min 11 s |
Is 57971 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 1) | 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 57971 a prime number?
No. 57971 = 29 × 1999, so it is divisible by 29.
What are the factors of 57971?
1, 29, 1999, 57971.
What is 57971 in binary?
1110001001110011 (hexadecimal E273, octal 161163).
What is the square root of 57971?
About 240.7717.
Is 57971 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 57971?
57971 is a Harshad number: divisible by its digit sum 29; a semiprime: 29 × 1999, the product of two primes.