The number 22565
22565 is a composite number with 4 divisors. Its prime factorisation is 5 × 4513. Divisors (4): 1, 5, 4513, 22565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 22565: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 4513, the product of two primes.
- 2
22565 is composite. Its prime factorisation is
- 3
The divisors add up to 27084; without 22565 itself that is 4519, so 22565 is deficient (4519 is less than 22565). Euler's totient φ(22565) = 18048 numbers up to 22565 share no factor with it.
- 4
The digits of 22565 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 43 steps to reach 1.
LaTeX source of the formulas on this page
\[ 22565 = 5 \times 4513 \]
22565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 27084 |
| Euler totient φ(n) | 18048 |
| Square | 509179225 |
| Cube | 11489629212125 |
| Square root | 150.216510 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 43 |
| Scientific notation | 2.2565 × |
22565 in other forms
| Form | Value |
|---|---|
| In words | twenty-two thousand five hundred and sixty-five |
| Binary (base 2) | 101100000100101 |
| Octal (base 8) | 54045 |
| Hexadecimal (base 16) | 5825 |
| Base 3 | 1010221202 |
| As time | 22565 seconds = 6 h 16 min 5 s |
Is 22565 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 (22565 ÷ 5 = 4513) | 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 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 2) | 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 4) | 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 22565 a prime number?
No. 22565 = 5 × 4513, so it is divisible by 5.
What are the factors of 22565?
1, 5, 4513, 22565.
What is 22565 in binary?
101100000100101 (hexadecimal 5825, octal 54045).
What is the square root of 22565?
About 150.2165.
Is 22565 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 22565?
22565 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 4513, the product of two primes.