The number 52565
52565 is a composite number with 4 divisors. Its prime factorisation is 5 × 10513. Divisors (4): 1, 5, 10513, 52565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52565: a semiprime: 5 × 10513, the product of two primes.
- 2
52565 is composite. Its prime factorisation is
- 3
The divisors add up to 63084; without 52565 itself that is 10519, so 52565 is deficient (10519 is less than 52565). Euler's totient φ(52565) = 42048 numbers up to 52565 share no factor with it.
- 4
The digits of 52565 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 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52565 = 5 \times 10513 \]
52565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 63084 |
| Euler totient φ(n) | 42048 |
| Square | 2763079225 |
| Cube | 145241259462125 |
| Square root | 229.270583 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 34 |
| Scientific notation | 5.2565 × |
52565 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand five hundred and sixty-five |
| Binary (base 2) | 1100110101010101 |
| Octal (base 8) | 146525 |
| Hexadecimal (base 16) | CD55 |
| Base 3 | 2200002212 |
| As time | 52565 seconds = 14 h 36 min 5 s |
Is 52565 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 | Yes (52565 ÷ 5 = 10513) | 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 2) | 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 5) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52565 a prime number?
No. 52565 = 5 × 10513, so it is divisible by 5.
What are the factors of 52565?
1, 5, 10513, 52565.
What is 52565 in binary?
1100110101010101 (hexadecimal CD55, octal 146525).
What is the square root of 52565?
About 229.2706.
Is 52565 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 52565?
52565 is a semiprime: 5 × 10513, the product of two primes.