The number 53565
53565 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 3571. Divisors (8): 1, 3, 5, 15, 3571, 10713, 17855, 53565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53565 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53565 is composite. Its prime factorisation is
- 3
The divisors add up to 85728; without 53565 itself that is 32163, so 53565 is deficient (32163 is less than 53565). Euler's totient φ(53565) = 28560 numbers up to 53565 share no factor with it.
- 4
The digits of 53565 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53565 = 3 \times 5 \times 3571 \]
53565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 85728 |
| Euler totient φ(n) | 28560 |
| Square | 2869209225 |
| Cube | 153689192137125 |
| Square root | 231.441137 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.3565 × |
53565 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand five hundred and sixty-five |
| Binary (base 2) | 1101000100111101 |
| Octal (base 8) | 150475 |
| Hexadecimal (base 16) | D13D |
| Base 3 | 2201110220 |
| As time | 53565 seconds = 14 h 52 min 45 s |
Is 53565 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 | Yes (53565 ÷ 3 = 17855) | 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 (53565 ÷ 5 = 10713) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53565 a prime number?
No. 53565 = 3 × 5 × 3571, so it is divisible by 3.
What are the factors of 53565?
1, 3, 5, 15, 3571, 10713, 17855, 53565.
What is 53565 in binary?
1101000100111101 (hexadecimal D13D, octal 150475).
What is the square root of 53565?
About 231.4411.
Is 53565 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 53565?
It is a composite number with 8 divisors.