The number 26781
26781 is a composite number with 8 divisors. Its prime factorisation is 3 × 79 × 113. Divisors (8): 1, 3, 79, 113, 237, 339, 8927, 26781.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
26781 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
26781 is composite. Its prime factorisation is
- 3
The divisors add up to 36480; without 26781 itself that is 9699, so 26781 is deficient (9699 is less than 26781). Euler's totient φ(26781) = 17472 numbers up to 26781 share no factor with it.
- 4
The digits of 26781 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 46 steps to reach 1.
LaTeX source of the formulas on this page
\[ 26781 = 3 \times 79 \times 113 \]
26781 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 36480 |
| Euler totient φ(n) | 17472 |
| Square | 717221961 |
| Cube | 19207921337541 |
| Square root | 163.649015 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 46 |
| Scientific notation | 2.6781 × |
26781 in other forms
| Form | Value |
|---|---|
| In words | twenty-six thousand seven hundred and eighty-one |
| Binary (base 2) | 110100010011101 |
| Octal (base 8) | 64235 |
| Hexadecimal (base 16) | 689D |
| Base 3 | 1100201220 |
| As time | 26781 seconds = 7 h 26 min 21 s |
Is 26781 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 | Yes (26781 ÷ 3 = 8927) | 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 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 26781 a prime number?
No. 26781 = 3 × 79 × 113, so it is divisible by 3.
What are the factors of 26781?
1, 3, 79, 113, 237, 339, 8927, 26781.
What is 26781 in binary?
110100010011101 (hexadecimal 689D, octal 64235).
What is the square root of 26781?
About 163.6490.
Is 26781 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 26781?
It is a composite number with 8 divisors.