The number 10961
10961 is a composite number with 4 divisors. Its prime factorisation is 97 × 113. Divisors (4): 1, 97, 113, 10961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10961: a semiprime: 97 × 113, the product of two primes.
- 2
10961 is composite. Its prime factorisation is
- 3
The divisors add up to 11172; without 10961 itself that is 211, so 10961 is deficient (211 is less than 10961). Euler's totient φ(10961) = 10752 numbers up to 10961 share no factor with it.
- 4
The digits of 10961 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10961 = 97 \times 113 \]
10961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11172 |
| Euler totient φ(n) | 10752 |
| Square | 120143521 |
| Cube | 1316893133681 |
| Square root | 104.694795 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.0961 × |
10961 in other forms
| Form | Value |
|---|---|
| In words | ten thousand nine hundred and sixty-one |
| Binary (base 2) | 10101011010001 |
| Octal (base 8) | 25321 |
| Hexadecimal (base 16) | 2AD1 |
| Base 3 | 120000222 |
| As time | 10961 seconds = 3 h 2 min 41 s |
Is 10961 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 8) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10961 a prime number?
No. 10961 = 97 × 113, so it is divisible by 97.
What are the factors of 10961?
1, 97, 113, 10961.
What is 10961 in binary?
10101011010001 (hexadecimal 2AD1, octal 25321).
What is the square root of 10961?
About 104.6948.
Is 10961 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 10961?
10961 is a semiprime: 97 × 113, the product of two primes.