The number 9565
9565 is a composite number with 4 divisors. Its prime factorisation is 5 × 1913. Divisors (4): 1, 5, 1913, 9565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9565: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 1913, the product of two primes.
- 2
9565 is composite. Its prime factorisation is
- 3
The divisors add up to 11484; without 9565 itself that is 1919, so 9565 is deficient (1919 is less than 9565). Euler's totient φ(9565) = 7648 numbers up to 9565 share no factor with it.
- 4
The digits of 9565 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 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9565 = 5 \times 1913 \]
9565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11484 |
| Euler totient φ(n) | 7648 |
| Square | 91489225 |
| Cube | 875094437125 |
| Square root | 97.800818 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 122 |
| Scientific notation | 9.565 × |
9565 in other forms
| Form | Value |
|---|---|
| In words | nine thousand five hundred and sixty-five |
| Binary (base 2) | 10010101011101 |
| Octal (base 8) | 22535 |
| Hexadecimal (base 16) | 255D |
| Base 3 | 111010021 |
| As time | 9565 seconds = 2 h 39 min 25 s |
Is 9565 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 (9565 ÷ 5 = 1913) | 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 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 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 6) | 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 9565 a prime number?
No. 9565 = 5 × 1913, so it is divisible by 5.
What are the factors of 9565?
1, 5, 1913, 9565.
What is 9565 in binary?
10010101011101 (hexadecimal 255D, octal 22535).
What is the square root of 9565?
About 97.8008.
Is 9565 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 9565?
9565 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 1913, the product of two primes.