The number 57461
57461 is a composite number with 4 divisors. Its prime factorisation is 37 × 1553. Divisors (4): 1, 37, 1553, 57461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 57461: a semiprime: 37 × 1553, the product of two primes.
- 2
57461 is composite. Its prime factorisation is
- 3
The divisors add up to 59052; without 57461 itself that is 1591, so 57461 is deficient (1591 is less than 57461). Euler's totient φ(57461) = 55872 numbers up to 57461 share no factor with it.
- 4
The digits of 57461 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 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57461 = 37 \times 1553 \]
57461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 59052 |
| Euler totient φ(n) | 55872 |
| Square | 3301766521 |
| Cube | 189722806063181 |
| Square root | 239.710242 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.7461 × |
57461 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand four hundred and sixty-one |
| Binary (base 2) | 1110000001110101 |
| Octal (base 8) | 160165 |
| Hexadecimal (base 16) | E075 |
| Base 3 | 2220211012 |
| As time | 57461 seconds = 15 h 57 min 41 s |
Is 57461 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 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 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 5) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 57461 a prime number?
No. 57461 = 37 × 1553, so it is divisible by 37.
What are the factors of 57461?
1, 37, 1553, 57461.
What is 57461 in binary?
1110000001110101 (hexadecimal E075, octal 160165).
What is the square root of 57461?
About 239.7102.
Is 57461 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 57461?
57461 is a semiprime: 37 × 1553, the product of two primes.