The number 57141
57141 is a composite number with 12 divisors. Its prime factorisation is × 7 × 907. Divisors (12): 1, 3, 7, 9, 21, 63, 907, 2721, 6349, 8163, 19047, 57141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
57141 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
57141 is composite. Its prime factorisation is
- 3
The divisors add up to 94432; without 57141 itself that is 37291, so 57141 is deficient (37291 is less than 57141). Euler's totient φ(57141) = 32616 numbers up to 57141 share no factor with it.
- 4
The digits of 57141 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57141 = 3^{2} \times 7 \times 907 \]57141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 94432 |
| Euler totient φ(n) | 32616 |
| Square | 3265093881 |
| Cube | 186570729454221 |
| Square root | 239.041837 (= 3√6349) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 34 |
| Scientific notation | 5.7141 × |
57141 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand one hundred and forty-one |
| Binary (base 2) | 1101111100110101 |
| Octal (base 8) | 157465 |
| Hexadecimal (base 16) | DF35 |
| Base 3 | 2220101100 |
| As time | 57141 seconds = 15 h 52 min 21 s |
Is 57141 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 | Yes (57141 ÷ 3 = 19047) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (57141 ÷ 7 = 8163) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (57141 ÷ 9 = 6349) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 57141 a prime number?
No. 57141 = × 7 × 907, so it is divisible by 3.
What are the factors of 57141?
1, 3, 7, 9, 21, 63, 907, 2721, 6349, 8163, 19047, 57141.
What is 57141 in binary?
1101111100110101 (hexadecimal DF35, octal 157465).
What is the square root of 57141?
About 239.0418, exactly 3√6349.
Is 57141 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 57141?
It is a composite number with 12 divisors.