The number 3268
3268 is a composite number with 12 divisors. Its prime factorisation is × 19 × 43. Divisors (12): 1, 2, 4, 19, 38, 43, 76, 86, 172, 817, 1634, 3268.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 3268: a Harshad number: divisible by its digit sum 19.
- 2
3268 is composite. Its prime factorisation is
- 3
The divisors add up to 6160; without 3268 itself that is 2892, so 3268 is deficient (2892 is less than 3268). Euler's totient φ(3268) = 1512 numbers up to 3268 share no factor with it.
- 4
The digits of 3268 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 43 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3268 = 2^{2} \times 19 \times 43 \]3268 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 6160 |
| Euler totient φ(n) | 1512 |
| Square | 10679824 |
| Cube | 34901664832 |
| Square root | 57.166424 (= 2√817) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 43 |
| Scientific notation | 3.268 × |
3268 in other forms
| Form | Value |
|---|---|
| In words | three thousand two hundred and sixty-eight |
| Roman numerals | MMMCCLXVIII |
| Binary (base 2) | 110011000100 |
| Octal (base 8) | 6304 |
| Hexadecimal (base 16) | CC4 |
| Base 3 | 11111001 |
| As time | 3268 seconds = 54 min 28 s |
Is 3268 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (3268 ÷ 2 = 1634) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (3268 ÷ 4 = 817) | 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 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 3268 a prime number?
No. 3268 = × 19 × 43, so it is divisible by 2.
What are the factors of 3268?
1, 2, 4, 19, 38, 43, 76, 86, 172, 817, 1634, 3268.
What is 3268 in binary?
110011000100 (hexadecimal CC4, octal 6304).
What is the square root of 3268?
About 57.1664, exactly 2√817.
What is 3268 in Roman numerals?
MMMCCLXVIII.
Is 3268 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 3268?
3268 is a Harshad number: divisible by its digit sum 19.