The number 3201
3201 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 97. Divisors (8): 1, 3, 11, 33, 97, 291, 1067, 3201.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
3201 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
3201 is composite. Its prime factorisation is
- 3
The divisors add up to 4704; without 3201 itself that is 1503, so 3201 is deficient (1503 is less than 3201). Euler's totient φ(3201) = 1920 numbers up to 3201 share no factor with it.
- 4
The digits of 3201 add up to 6, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 167 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3201 = 3 \times 11 \times 97 \]
3201 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 4704 |
| Euler totient φ(n) | 1920 |
| Square | 10246401 |
| Cube | 32798729601 |
| Square root | 56.577381 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 167 |
| Scientific notation | 3.201 × |
3201 in other forms
| Form | Value |
|---|---|
| In words | three thousand two hundred and one |
| Roman numerals | MMMCCI |
| Binary (base 2) | 110010000001 |
| Octal (base 8) | 6201 |
| Hexadecimal (base 16) | C81 |
| Base 3 | 11101120 |
| As time | 3201 seconds = 53 min 21 s |
Is 3201 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 (3201 ÷ 3 = 1067) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 (3201 ÷ 11 = 291) | 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 3201 a prime number?
No. 3201 = 3 × 11 × 97, so it is divisible by 3.
What are the factors of 3201?
1, 3, 11, 33, 97, 291, 1067, 3201.
What is 3201 in binary?
110010000001 (hexadecimal C81, octal 6201).
What is the square root of 3201?
About 56.5774.
What is 3201 in Roman numerals?
MMMCCI.
Is 3201 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 3201?
It is a composite number with 8 divisors.