The number 57371
57371 is a composite number with 4 divisors. Its prime factorisation is 103 × 557. Divisors (4): 1, 103, 557, 57371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 57371: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 103 × 557, the product of two primes.
- 2
57371 is composite. Its prime factorisation is
- 3
The divisors add up to 58032; without 57371 itself that is 661, so 57371 is deficient (661 is less than 57371). Euler's totient φ(57371) = 56712 numbers up to 57371 share no factor with it.
- 4
The digits of 57371 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 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57371 = 103 \times 557 \]
57371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 58032 |
| Euler totient φ(n) | 56712 |
| Square | 3291431641 |
| Cube | 188832724675811 |
| Square root | 239.522442 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.7371 × |
57371 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand three hundred and seventy-one |
| Binary (base 2) | 1110000000011011 |
| Octal (base 8) | 160033 |
| Hexadecimal (base 16) | E01B |
| Base 3 | 2220200212 |
| As time | 57371 seconds = 15 h 56 min 11 s |
Is 57371 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 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 3) | 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 57371 a prime number?
No. 57371 = 103 × 557, so it is divisible by 103.
What are the factors of 57371?
1, 103, 557, 57371.
What is 57371 in binary?
1110000000011011 (hexadecimal E01B, octal 160033).
What is the square root of 57371?
About 239.5224.
Is 57371 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 57371?
57371 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 103 × 557, the product of two primes.