The number 51565
51565 is a composite number with 4 divisors. Its prime factorisation is 5 × 10313. Divisors (4): 1, 5, 10313, 51565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51565: a semiprime: 5 × 10313, the product of two primes.
- 2
51565 is composite. Its prime factorisation is
- 3
The divisors add up to 61884; without 51565 itself that is 10319, so 51565 is deficient (10319 is less than 51565). Euler's totient φ(51565) = 41248 numbers up to 51565 share no factor with it.
- 4
The digits of 51565 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51565 = 5 \times 10313 \]
51565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 61884 |
| Euler totient φ(n) | 41248 |
| Square | 2658949225 |
| Cube | 137108716787125 |
| Square root | 227.079281 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1565 × |
51565 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and sixty-five |
| Binary (base 2) | 1100100101101101 |
| Octal (base 8) | 144555 |
| Hexadecimal (base 16) | C96D |
| Base 3 | 2121201211 |
| As time | 51565 seconds = 14 h 19 min 25 s |
Is 51565 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 (51565 ÷ 5 = 10313) | 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 3) | 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 4) | 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 8) | 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 51565 a prime number?
No. 51565 = 5 × 10313, so it is divisible by 5.
What are the factors of 51565?
1, 5, 10313, 51565.
What is 51565 in binary?
1100100101101101 (hexadecimal C96D, octal 144555).
What is the square root of 51565?
About 227.0793.
Is 51565 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 51565?
51565 is a semiprime: 5 × 10313, the product of two primes.