The number 26555
26555 is a composite number with 8 divisors. Its prime factorisation is 5 × 47 × 113. Divisors (8): 1, 5, 47, 113, 235, 565, 5311, 26555.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
26555 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
26555 is composite. Its prime factorisation is
- 3
The divisors add up to 32832; without 26555 itself that is 6277, so 26555 is deficient (6277 is less than 26555). Euler's totient φ(26555) = 20608 numbers up to 26555 share no factor with it.
- 4
The digits of 26555 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 77 steps to reach 1.
LaTeX source of the formulas on this page
\[ 26555 = 5 \times 47 \times 113 \]
26555 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 32832 |
| Euler totient φ(n) | 20608 |
| Square | 705168025 |
| Cube | 18725736903875 |
| Square root | 162.957050 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 77 |
| Scientific notation | 2.6555 × |
26555 in other forms
| Form | Value |
|---|---|
| In words | twenty-six thousand five hundred and fifty-five |
| Binary (base 2) | 110011110111011 |
| Octal (base 8) | 63673 |
| Hexadecimal (base 16) | 67BB |
| Base 3 | 1100102112 |
| As time | 26555 seconds = 7 h 22 min 35 s |
Is 26555 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 | Yes (26555 ÷ 5 = 5311) | 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 4) | 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 5) | 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 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 26555 a prime number?
No. 26555 = 5 × 47 × 113, so it is divisible by 5.
What are the factors of 26555?
1, 5, 47, 113, 235, 565, 5311, 26555.
What is 26555 in binary?
110011110111011 (hexadecimal 67BB, octal 63673).
What is the square root of 26555?
About 162.9570.
Is 26555 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 26555?
It is a composite number with 8 divisors.