The number 565
565 is a palindrome: it reads 565 backwards too. Its prime factorisation is 5 × 113. Divisors (4): 1, 5, 113, 565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 565: a palindrome: it reads 565 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 113, the product of two primes.
- 2
565 is composite. Its prime factorisation is
- 3
The divisors add up to 684; without 565 itself that is 119, so 565 is deficient (119 is less than 565). Euler's totient φ(565) = 448 numbers up to 565 share no factor with it.
- 4
The digits of 565 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 17 steps to reach 1.
LaTeX source of the formulas on this page
\[ 565 = 5 \times 113 \]
565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 684 |
| Euler totient φ(n) | 448 |
| Square | 319225 |
| Cube | 180362125 |
| Square root | 23.769729 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 17 |
| Scientific notation | 5.65 × |
565 in other forms
| Form | Value |
|---|---|
| In words | five hundred and sixty-five |
| Roman numerals | DLXV |
| Binary (base 2) | 1000110101 |
| Octal (base 8) | 1065 |
| Hexadecimal (base 16) | 235 |
| Base 3 | 202221 |
| As time | 565 seconds = 9 min 25 s |
Is 565 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 (565 ÷ 5 = 113) | 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 5) | 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 4) | 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 565 a prime number?
No. 565 = 5 × 113, so it is divisible by 5.
What are the factors of 565?
1, 5, 113, 565.
What is 565 in binary?
1000110101 (hexadecimal 235, octal 1065).
What is the square root of 565?
About 23.7697.
What is 565 in Roman numerals?
DLXV.
Is 565 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 565?
565 is a palindrome: it reads 565 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 113, the product of two primes.