The number 27565
27565 is a composite number with 8 divisors. Its prime factorisation is 5 × 37 × 149. Divisors (8): 1, 5, 37, 149, 185, 745, 5513, 27565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 27565: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
27565 is composite. Its prime factorisation is
- 3
The divisors add up to 34200; without 27565 itself that is 6635, so 27565 is deficient (6635 is less than 27565). Euler's totient φ(27565) = 21312 numbers up to 27565 share no factor with it.
- 4
The digits of 27565 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 152 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27565 = 5 \times 37 \times 149 \]
27565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 34200 |
| Euler totient φ(n) | 21312 |
| Square | 759829225 |
| Cube | 20944692587125 |
| Square root | 166.027106 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 152 |
| Scientific notation | 2.7565 × |
27565 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand five hundred and sixty-five |
| Binary (base 2) | 110101110101101 |
| Octal (base 8) | 65655 |
| Hexadecimal (base 16) | 6BAD |
| Base 3 | 1101210221 |
| As time | 27565 seconds = 7 h 39 min 25 s |
Is 27565 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 (27565 ÷ 5 = 5513) | 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 6) | 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 7) | 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 10) | 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 27565 a prime number?
No. 27565 = 5 × 37 × 149, so it is divisible by 5.
What are the factors of 27565?
1, 5, 37, 149, 185, 745, 5513, 27565.
What is 27565 in binary?
110101110101101 (hexadecimal 6BAD, octal 65655).
What is the square root of 27565?
About 166.0271.
Is 27565 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 27565?
27565 is a happy number: repeatedly adding the squares of its digits reaches 1.