The number 65561
65561 is a composite number with 4 divisors. Its prime factorisation is 53 × 1237. Divisors (4): 1, 53, 1237, 65561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 65561: a semiprime: 53 × 1237, the product of two primes.
- 2
65561 is composite. Its prime factorisation is
- 3
The divisors add up to 66852; without 65561 itself that is 1291, so 65561 is deficient (1291 is less than 65561). Euler's totient φ(65561) = 64272 numbers up to 65561 share no factor with it.
- 4
The digits of 65561 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65561 = 53 \times 1237 \]
65561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 66852 |
| Euler totient φ(n) | 64272 |
| Square | 4298244721 |
| Cube | 281797222153481 |
| Square root | 256.048823 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.5561 × |
65561 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand five hundred and sixty-one |
| Binary (base 2) | 10000000000011001 |
| Octal (base 8) | 200031 |
| Hexadecimal (base 16) | 10019 |
| Base 3 | 10022221012 |
| As time | 65561 seconds = 18 h 12 min 41 s |
Is 65561 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 | No (remainder 1) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 65561 a prime number?
No. 65561 = 53 × 1237, so it is divisible by 53.
What are the factors of 65561?
1, 53, 1237, 65561.
What is 65561 in binary?
10000000000011001 (hexadecimal 10019, octal 200031).
What is the square root of 65561?
About 256.0488.
Is 65561 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 65561?
65561 is a semiprime: 53 × 1237, the product of two primes.