The number 26561
26561 is the 2915th prime number. Its only divisors are 1 and 26561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 26561: the 2915th prime number.
- 2
26561 is prime, so its only factors are 1 and 26561. It is the 2915th prime; the next prime is 26573 and the one before is 26557.
- 3
The divisors add up to 26562; without 26561 itself that is 1, so 26561 is deficient (1 is less than 26561). Euler's totient φ(26561) = 26560 numbers up to 26561 share no factor with it.
- 4
The digits of 26561 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 46 steps to reach 1.
26561 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 26562 |
| Euler totient φ(n) | 26560 |
| Square | 705486721 |
| Cube | 18738432796481 |
| Square root | 162.975458 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 46 |
| Scientific notation | 2.6561 × |
26561 in other forms
| Form | Value |
|---|---|
| In words | twenty-six thousand five hundred and sixty-one |
| Binary (base 2) | 110011111000001 |
| Octal (base 8) | 63701 |
| Hexadecimal (base 16) | 67C1 |
| Base 3 | 1100102202 |
| As time | 26561 seconds = 7 h 22 min 41 s |
Is 26561 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 7) | 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 26561 a prime number?
Yes. 26561 is divisible only by 1 and itself.
What are the factors of 26561?
1, 26561.
What is 26561 in binary?
110011111000001 (hexadecimal 67C1, octal 63701).
What is the square root of 26561?
About 162.9755.
Is 26561 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 26561?
26561 is the 2915th prime number.