The number 10641
10641 is a composite number with 4 divisors. Its prime factorisation is 3 × 3547. Divisors (4): 1, 3, 3547, 10641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10641: a semiprime: 3 × 3547, the product of two primes.
- 2
10641 is composite. Its prime factorisation is
- 3
The divisors add up to 14192; without 10641 itself that is 3551, so 10641 is deficient (3551 is less than 10641). Euler's totient φ(10641) = 7092 numbers up to 10641 share no factor with it.
- 4
The digits of 10641 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10641 = 3 \times 3547 \]
10641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14192 |
| Euler totient φ(n) | 7092 |
| Square | 113230881 |
| Cube | 1204889804721 |
| Square root | 103.155223 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.0641 × |
10641 in other forms
| Form | Value |
|---|---|
| In words | ten thousand six hundred and forty-one |
| Binary (base 2) | 10100110010001 |
| Octal (base 8) | 24621 |
| Hexadecimal (base 16) | 2991 |
| Base 3 | 112121010 |
| As time | 10641 seconds = 2 h 57 min 21 s |
Is 10641 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 (10641 ÷ 3 = 3547) | 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 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 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 4) | 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 10641 a prime number?
No. 10641 = 3 × 3547, so it is divisible by 3.
What are the factors of 10641?
1, 3, 3547, 10641.
What is 10641 in binary?
10100110010001 (hexadecimal 2991, octal 24621).
What is the square root of 10641?
About 103.1552.
Is 10641 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 10641?
10641 is a semiprime: 3 × 3547, the product of two primes.