The number 32641
32641 is a composite number with 4 divisors. Its prime factorisation is 7 × 4663. Divisors (4): 1, 7, 4663, 32641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32641: a semiprime: 7 × 4663, the product of two primes.
- 2
32641 is composite. Its prime factorisation is
- 3
The divisors add up to 37312; without 32641 itself that is 4671, so 32641 is deficient (4671 is less than 32641). Euler's totient φ(32641) = 27972 numbers up to 32641 share no factor with it.
- 4
The digits of 32641 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32641 = 7 \times 4663 \]
32641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 37312 |
| Euler totient φ(n) | 27972 |
| Square | 1065434881 |
| Cube | 34776859950721 |
| Square root | 180.668204 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 67 |
| Scientific notation | 3.2641 × |
32641 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand six hundred and forty-one |
| Binary (base 2) | 111111110000001 |
| Octal (base 8) | 77601 |
| Hexadecimal (base 16) | 7F81 |
| Base 3 | 1122202221 |
| As time | 32641 seconds = 9 h 4 min 1 s |
Is 32641 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (32641 ÷ 7 = 4663) | 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 7) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32641 a prime number?
No. 32641 = 7 × 4663, so it is divisible by 7.
What are the factors of 32641?
1, 7, 4663, 32641.
What is 32641 in binary?
111111110000001 (hexadecimal 7F81, octal 77601).
What is the square root of 32641?
About 180.6682.
Is 32641 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 32641?
32641 is a semiprime: 7 × 4663, the product of two primes.