The number 1565
1565 is a composite number with 4 divisors. Its prime factorisation is 5 × 313. Divisors (4): 1, 5, 313, 1565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1565: a semiprime: 5 × 313, the product of two primes.
- 2
1565 is composite. Its prime factorisation is
- 3
The divisors add up to 1884; without 1565 itself that is 319, so 1565 is deficient (319 is less than 1565). Euler's totient φ(1565) = 1248 numbers up to 1565 share no factor with it.
- 4
The digits of 1565 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1565 = 5 \times 313 \]
1565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1884 |
| Euler totient φ(n) | 1248 |
| Square | 2449225 |
| Cube | 3833037125 |
| Square root | 39.560081 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 122 |
| Scientific notation | 1.565 × |
1565 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and sixty-five |
| Roman numerals | MDLXV |
| Binary (base 2) | 11000011101 |
| Octal (base 8) | 3035 |
| Hexadecimal (base 16) | 61D |
| Base 3 | 2010222 |
| As time | 1565 seconds = 26 min 5 s |
Is 1565 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 (1565 ÷ 5 = 313) | 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 8) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1565 a prime number?
No. 1565 = 5 × 313, so it is divisible by 5.
What are the factors of 1565?
1, 5, 313, 1565.
What is 1565 in binary?
11000011101 (hexadecimal 61D, octal 3035).
What is the square root of 1565?
About 39.5601.
What is 1565 in Roman numerals?
MDLXV.
Is 1565 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 1565?
1565 is a semiprime: 5 × 313, the product of two primes.