The number 26931
26931 is a composite number with 8 divisors. Its prime factorisation is 3 × 47 × 191. Divisors (8): 1, 3, 47, 141, 191, 573, 8977, 26931.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
26931 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
26931 is composite. Its prime factorisation is
- 3
The divisors add up to 36864; without 26931 itself that is 9933, so 26931 is deficient (9933 is less than 26931). Euler's totient φ(26931) = 17480 numbers up to 26931 share no factor with it.
- 4
The digits of 26931 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 90 steps to reach 1.
LaTeX source of the formulas on this page
\[ 26931 = 3 \times 47 \times 191 \]
26931 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 36864 |
| Euler totient φ(n) | 17480 |
| Square | 725278761 |
| Cube | 19532482312491 |
| Square root | 164.106673 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 90 |
| Scientific notation | 2.6931 × |
26931 in other forms
| Form | Value |
|---|---|
| In words | twenty-six thousand nine hundred and thirty-one |
| Binary (base 2) | 110100100110011 |
| Octal (base 8) | 64463 |
| Hexadecimal (base 16) | 6933 |
| Base 3 | 1100221110 |
| As time | 26931 seconds = 7 h 28 min 51 s |
Is 26931 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 (26931 ÷ 3 = 8977) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 3) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 26931 a prime number?
No. 26931 = 3 × 47 × 191, so it is divisible by 3.
What are the factors of 26931?
1, 3, 47, 141, 191, 573, 8977, 26931.
What is 26931 in binary?
110100100110011 (hexadecimal 6933, octal 64463).
What is the square root of 26931?
About 164.1067.
Is 26931 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 26931?
It is a composite number with 8 divisors.