The number 10941
10941 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 521. Divisors (8): 1, 3, 7, 21, 521, 1563, 3647, 10941.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10941 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10941 is composite. Its prime factorisation is
- 3
The divisors add up to 16704; without 10941 itself that is 5763, so 10941 is deficient (5763 is less than 10941). Euler's totient φ(10941) = 6240 numbers up to 10941 share no factor with it.
- 4
The digits of 10941 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 161 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10941 = 3 \times 7 \times 521 \]
10941 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 16704 |
| Euler totient φ(n) | 6240 |
| Square | 119705481 |
| Cube | 1309697667621 |
| Square root | 104.599235 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 161 |
| Scientific notation | 1.0941 × |
10941 in other forms
| Form | Value |
|---|---|
| In words | ten thousand nine hundred and forty-one |
| Binary (base 2) | 10101010111101 |
| Octal (base 8) | 25275 |
| Hexadecimal (base 16) | 2ABD |
| Base 3 | 120000020 |
| As time | 10941 seconds = 3 h 2 min 21 s |
Is 10941 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 (10941 ÷ 3 = 3647) | 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 | Yes (10941 ÷ 7 = 1563) | 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 5) | 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 | No (remainder 7) | 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 10941 a prime number?
No. 10941 = 3 × 7 × 521, so it is divisible by 3.
What are the factors of 10941?
1, 3, 7, 21, 521, 1563, 3647, 10941.
What is 10941 in binary?
10101010111101 (hexadecimal 2ABD, octal 25275).
What is the square root of 10941?
About 104.5992.
Is 10941 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 10941?
It is a composite number with 8 divisors.