The number 3261
3261 is a composite number with 4 divisors. Its prime factorisation is 3 × 1087. Divisors (4): 1, 3, 1087, 3261.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 3261: a semiprime: 3 × 1087, the product of two primes.
- 2
3261 is composite. Its prime factorisation is
- 3
The divisors add up to 4352; without 3261 itself that is 1091, so 3261 is deficient (1091 is less than 3261). Euler's totient φ(3261) = 2172 numbers up to 3261 share no factor with it.
- 4
The digits of 3261 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 136 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3261 = 3 \times 1087 \]
3261 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 4352 |
| Euler totient φ(n) | 2172 |
| Square | 10634121 |
| Cube | 34677868581 |
| Square root | 57.105166 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 136 |
| Scientific notation | 3.261 × |
3261 in other forms
| Form | Value |
|---|---|
| In words | three thousand two hundred and sixty-one |
| Roman numerals | MMMCCLXI |
| Binary (base 2) | 110010111101 |
| Octal (base 8) | 6275 |
| Hexadecimal (base 16) | CBD |
| Base 3 | 11110210 |
| As time | 3261 seconds = 54 min 21 s |
Is 3261 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 (3261 ÷ 3 = 1087) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 3261 a prime number?
No. 3261 = 3 × 1087, so it is divisible by 3.
What are the factors of 3261?
1, 3, 1087, 3261.
What is 3261 in binary?
110010111101 (hexadecimal CBD, octal 6275).
What is the square root of 3261?
About 57.1052.
What is 3261 in Roman numerals?
MMMCCLXI.
Is 3261 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 3261?
3261 is a semiprime: 3 × 1087, the product of two primes.