The number 23565
23565 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 1571. Divisors (8): 1, 3, 5, 15, 1571, 4713, 7855, 23565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
23565 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
23565 is composite. Its prime factorisation is
- 3
The divisors add up to 37728; without 23565 itself that is 14163, so 23565 is deficient (14163 is less than 23565). Euler's totient φ(23565) = 12560 numbers up to 23565 share no factor with it.
- 4
The digits of 23565 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 82 steps to reach 1.
LaTeX source of the formulas on this page
\[ 23565 = 3 \times 5 \times 1571 \]
23565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 37728 |
| Euler totient φ(n) | 12560 |
| Square | 555309225 |
| Cube | 13085861887125 |
| Square root | 153.508957 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 82 |
| Scientific notation | 2.3565 × |
23565 in other forms
| Form | Value |
|---|---|
| In words | twenty-three thousand five hundred and sixty-five |
| Binary (base 2) | 101110000001101 |
| Octal (base 8) | 56015 |
| Hexadecimal (base 16) | 5C0D |
| Base 3 | 1012022210 |
| As time | 23565 seconds = 6 h 32 min 45 s |
Is 23565 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 (23565 ÷ 3 = 7855) | 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 (23565 ÷ 5 = 4713) | 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 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 3) | 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 3) | 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 23565 a prime number?
No. 23565 = 3 × 5 × 1571, so it is divisible by 3.
What are the factors of 23565?
1, 3, 5, 15, 1571, 4713, 7855, 23565.
What is 23565 in binary?
101110000001101 (hexadecimal 5C0D, octal 56015).
What is the square root of 23565?
About 153.5090.
Is 23565 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 23565?
It is a composite number with 8 divisors.