The number 32961
32961 is a composite number with 4 divisors. Its prime factorisation is 3 × 10987. Divisors (4): 1, 3, 10987, 32961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32961: a semiprime: 3 × 10987, the product of two primes.
- 2
32961 is composite. Its prime factorisation is
- 3
The divisors add up to 43952; without 32961 itself that is 10991, so 32961 is deficient (10991 is less than 32961). Euler's totient φ(32961) = 21972 numbers up to 32961 share no factor with it.
- 4
The digits of 32961 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 98 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32961 = 3 \times 10987 \]
32961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 43952 |
| Euler totient φ(n) | 21972 |
| Square | 1086427521 |
| Cube | 35809737519681 |
| Square root | 181.551646 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 98 |
| Scientific notation | 3.2961 × |
32961 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand nine hundred and sixty-one |
| Binary (base 2) | 1000000011000001 |
| Octal (base 8) | 100301 |
| Hexadecimal (base 16) | 80C1 |
| Base 3 | 1200012210 |
| As time | 32961 seconds = 9 h 9 min 21 s |
Is 32961 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 (32961 ÷ 3 = 10987) | 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 5) | 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 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 32961 a prime number?
No. 32961 = 3 × 10987, so it is divisible by 3.
What are the factors of 32961?
1, 3, 10987, 32961.
What is 32961 in binary?
1000000011000001 (hexadecimal 80C1, octal 100301).
What is the square root of 32961?
About 181.5516.
Is 32961 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 32961?
32961 is a semiprime: 3 × 10987, the product of two primes.