The number 26590
26590 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 2659. Divisors (8): 1, 2, 5, 10, 2659, 5318, 13295, 26590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
26590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
26590 is composite. Its prime factorisation is
- 3
The divisors add up to 47880; without 26590 itself that is 21290, so 26590 is deficient (21290 is less than 26590). Euler's totient φ(26590) = 10632 numbers up to 26590 share no factor with it.
- 4
The digits of 26590 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 77 steps to reach 1.
LaTeX source of the formulas on this page
\[ 26590 = 2 \times 5 \times 2659 \]
26590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 47880 |
| Euler totient φ(n) | 10632 |
| Square | 707028100 |
| Cube | 18799877179000 |
| Square root | 163.064404 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 77 |
| Scientific notation | 2.659 × |
26590 in other forms
| Form | Value |
|---|---|
| In words | twenty-six thousand five hundred and ninety |
| Binary (base 2) | 110011111011110 |
| Octal (base 8) | 63736 |
| Hexadecimal (base 16) | 67DE |
| Base 3 | 1100110211 |
| As time | 26590 seconds = 7 h 23 min 10 s |
Is 26590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (26590 ÷ 2 = 13295) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (26590 ÷ 5 = 5318) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (26590 ÷ 10 = 2659) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 26590 a prime number?
No. 26590 = 2 × 5 × 2659, so it is divisible by 2.
What are the factors of 26590?
1, 2, 5, 10, 2659, 5318, 13295, 26590.
What is 26590 in binary?
110011111011110 (hexadecimal 67DE, octal 63736).
What is the square root of 26590?
About 163.0644.
Is 26590 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 26590?
It is a composite number with 8 divisors.