The number 26912
26912 is a composite number with 18 divisors. Its prime factorisation is × . Divisors (18): 1, 2, 4, 8, 16, 29, 32, 58, 116, 232, 464, 841, 928, 1682, 3364, 6728 … 26912.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
26912 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
26912 is composite. Its prime factorisation is
- 3
The divisors add up to 54873; without 26912 itself that is 27961, so 26912 is abundant (27961 is more than 26912). Euler's totient φ(26912) = 12992 numbers up to 26912 share no factor with it.
- 4
The digits of 26912 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
\[ 26912 = 2^{5} \times 29^{2} \]26912 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 54873 |
| Euler totient φ(n) | 12992 |
| Square | 724255744 |
| Cube | 19491170582528 |
| Square root | 164.048773 (= 116√2) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 46 |
| Scientific notation | 2.6912 × |
26912 in other forms
| Form | Value |
|---|---|
| In words | twenty-six thousand nine hundred and twelve |
| Binary (base 2) | 110100100100000 |
| Octal (base 8) | 64440 |
| Hexadecimal (base 16) | 6920 |
| Base 3 | 1100220202 |
| As time | 26912 seconds = 7 h 28 min 32 s |
Is 26912 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (26912 ÷ 2 = 13456) | 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 | Yes (26912 ÷ 4 = 6728) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 | Yes (26912 ÷ 8 = 3364) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 26912 a prime number?
No. 26912 = × , so it is divisible by 2.
What are the factors of 26912?
1, 2, 4, 8, 16, 29, 32, 58, 116, 232, 464, 841, 928, 1682, 3364, 6728, 13456, 26912.
What is 26912 in binary?
110100100100000 (hexadecimal 6920, octal 64440).
What is the square root of 26912?
About 164.0488, exactly 116√2.
Is 26912 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 26912?
It is a composite number with 18 divisors.