The number 26291
26291 is a binary palindrome (110011010110011). Its prime factorisation is 61 × 431. Divisors (4): 1, 61, 431, 26291.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 26291: a binary palindrome (110011010110011); a semiprime: 61 × 431, the product of two primes.
- 2
26291 is composite. Its prime factorisation is
- 3
The divisors add up to 26784; without 26291 itself that is 493, so 26291 is deficient (493 is less than 26291). Euler's totient φ(26291) = 25800 numbers up to 26291 share no factor with it.
- 4
The digits of 26291 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.
LaTeX source of the formulas on this page
\[ 26291 = 61 \times 431 \]
26291 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 26784 |
| Euler totient φ(n) | 25800 |
| Square | 691216681 |
| Cube | 18172777760171 |
| Square root | 162.144997 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 46 |
| Scientific notation | 2.6291 × |
26291 in other forms
| Form | Value |
|---|---|
| In words | twenty-six thousand two hundred and ninety-one |
| Binary (base 2) | 110011010110011 |
| Octal (base 8) | 63263 |
| Hexadecimal (base 16) | 66B3 |
| Base 3 | 1100001202 |
| As time | 26291 seconds = 7 h 18 min 11 s |
Is 26291 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 3) | 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 3) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 26291 a prime number?
No. 26291 = 61 × 431, so it is divisible by 61.
What are the factors of 26291?
1, 61, 431, 26291.
What is 26291 in binary?
110011010110011 (hexadecimal 66B3, octal 63263).
What is the square root of 26291?
About 162.1450.
Is 26291 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 26291?
26291 is a binary palindrome (110011010110011); a semiprime: 61 × 431, the product of two primes.