The number 57565
57565 is a composite number with 8 divisors. Its prime factorisation is 5 × 29 × 397. Divisors (8): 1, 5, 29, 145, 397, 1985, 11513, 57565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
57565 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
57565 is composite. Its prime factorisation is
- 3
The divisors add up to 71640; without 57565 itself that is 14075, so 57565 is deficient (14075 is less than 57565). Euler's totient φ(57565) = 44352 numbers up to 57565 share no factor with it.
- 4
The digits of 57565 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57565 = 5 \times 29 \times 397 \]
57565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 71640 |
| Euler totient φ(n) | 44352 |
| Square | 3313729225 |
| Cube | 190754822837125 |
| Square root | 239.927072 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.7565 × |
57565 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand five hundred and sixty-five |
| Binary (base 2) | 1110000011011101 |
| Octal (base 8) | 160335 |
| Hexadecimal (base 16) | E0DD |
| Base 3 | 2220222001 |
| As time | 57565 seconds = 15 h 59 min 25 s |
Is 57565 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 | Yes (57565 ÷ 5 = 11513) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 57565 a prime number?
No. 57565 = 5 × 29 × 397, so it is divisible by 5.
What are the factors of 57565?
1, 5, 29, 145, 397, 1985, 11513, 57565.
What is 57565 in binary?
1110000011011101 (hexadecimal E0DD, octal 160335).
What is the square root of 57565?
About 239.9271.
Is 57565 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 57565?
It is a composite number with 8 divisors.