The number 8261
8261 is a composite number with 4 divisors. Its prime factorisation is 11 × 751. Divisors (4): 1, 11, 751, 8261.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 8261: a semiprime: 11 × 751, the product of two primes.
- 2
8261 is composite. Its prime factorisation is
- 3
The divisors add up to 9024; without 8261 itself that is 763, so 8261 is deficient (763 is less than 8261). Euler's totient φ(8261) = 7500 numbers up to 8261 share no factor with it.
- 4
The digits of 8261 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 8261 = 11 \times 751 \]
8261 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 9024 |
| Euler totient φ(n) | 7500 |
| Square | 68244121 |
| Cube | 563764683581 |
| Square root | 90.890043 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 127 |
| Scientific notation | 8.261 × |
8261 in other forms
| Form | Value |
|---|---|
| In words | eight thousand two hundred and sixty-one |
| Binary (base 2) | 10000001000101 |
| Octal (base 8) | 20105 |
| Hexadecimal (base 16) | 2045 |
| Base 3 | 102022222 |
| As time | 8261 seconds = 2 h 17 min 41 s |
Is 8261 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 8) | 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 | Yes (8261 ÷ 11 = 751) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 8261 a prime number?
No. 8261 = 11 × 751, so it is divisible by 11.
What are the factors of 8261?
1, 11, 751, 8261.
What is 8261 in binary?
10000001000101 (hexadecimal 2045, octal 20105).
What is the square root of 8261?
About 90.8900.
Is 8261 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 8261?
8261 is a semiprime: 11 × 751, the product of two primes.