The number 57061
57061 is a composite number with 4 divisors. Its prime factorisation is 43 × 1327. Divisors (4): 1, 43, 1327, 57061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 57061: a semiprime: 43 × 1327, the product of two primes.
- 2
57061 is composite. Its prime factorisation is
- 3
The divisors add up to 58432; without 57061 itself that is 1371, so 57061 is deficient (1371 is less than 57061). Euler's totient φ(57061) = 55692 numbers up to 57061 share no factor with it.
- 4
The digits of 57061 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57061 = 43 \times 1327 \]
57061 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 58432 |
| Euler totient φ(n) | 55692 |
| Square | 3255957721 |
| Cube | 185788203517981 |
| Square root | 238.874444 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.7061 × |
57061 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand and sixty-one |
| Binary (base 2) | 1101111011100101 |
| Octal (base 8) | 157345 |
| Hexadecimal (base 16) | DEE5 |
| Base 3 | 2220021101 |
| As time | 57061 seconds = 15 h 51 min 1 s |
Is 57061 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 1) | 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 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 57061 a prime number?
No. 57061 = 43 × 1327, so it is divisible by 43.
What are the factors of 57061?
1, 43, 1327, 57061.
What is 57061 in binary?
1101111011100101 (hexadecimal DEE5, octal 157345).
What is the square root of 57061?
About 238.8744.
Is 57061 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 57061?
57061 is a semiprime: 43 × 1327, the product of two primes.