The number 3263
3263 is a composite number with 4 divisors. Its prime factorisation is 13 × 251. Divisors (4): 1, 13, 251, 3263.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 3263: a semiprime: 13 × 251, the product of two primes.
- 2
3263 is composite. Its prime factorisation is
- 3
The divisors add up to 3528; without 3263 itself that is 265, so 3263 is deficient (265 is less than 3263). Euler's totient φ(3263) = 3000 numbers up to 3263 share no factor with it.
- 4
The digits of 3263 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 74 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3263 = 13 \times 251 \]
3263 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 3528 |
| Euler totient φ(n) | 3000 |
| Square | 10647169 |
| Cube | 34741712447 |
| Square root | 57.122675 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 74 |
| Scientific notation | 3.263 × |
3263 in other forms
| Form | Value |
|---|---|
| In words | three thousand two hundred and sixty-three |
| Roman numerals | MMMCCLXIII |
| Binary (base 2) | 110010111111 |
| Octal (base 8) | 6277 |
| Hexadecimal (base 16) | CBF |
| Base 3 | 11110212 |
| As time | 3263 seconds = 54 min 23 s |
Is 3263 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 3263 a prime number?
No. 3263 = 13 × 251, so it is divisible by 13.
What are the factors of 3263?
1, 13, 251, 3263.
What is 3263 in binary?
110010111111 (hexadecimal CBF, octal 6277).
What is the square root of 3263?
About 57.1227.
What is 3263 in Roman numerals?
MMMCCLXIII.
Is 3263 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 3263?
3263 is a semiprime: 13 × 251, the product of two primes.