The number 1961
1961 is a composite number with 4 divisors. Its prime factorisation is 37 × 53. Divisors (4): 1, 37, 53, 1961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1961: a semiprime: 37 × 53, the product of two primes.
- 2
1961 is composite. Its prime factorisation is
- 3
The divisors add up to 2052; without 1961 itself that is 91, so 1961 is deficient (91 is less than 1961). Euler's totient φ(1961) = 1872 numbers up to 1961 share no factor with it.
- 4
The digits of 1961 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 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1961 = 37 \times 53 \]
1961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2052 |
| Euler totient φ(n) | 1872 |
| Square | 3845521 |
| Cube | 7541066681 |
| Square root | 44.283180 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 174 |
| Scientific notation | 1.961 × |
1961 in other forms
| Form | Value |
|---|---|
| In words | one thousand nine hundred and sixty-one |
| Roman numerals | MCMLXI |
| Binary (base 2) | 11110101001 |
| Octal (base 8) | 3651 |
| Hexadecimal (base 16) | 7A9 |
| Base 3 | 2200122 |
| As time | 1961 seconds = 32 min 41 s |
Is 1961 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 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 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 3) | 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 1961 a prime number?
No. 1961 = 37 × 53, so it is divisible by 37.
What are the factors of 1961?
1, 37, 53, 1961.
What is 1961 in binary?
11110101001 (hexadecimal 7A9, octal 3651).
What is the square root of 1961?
About 44.2832.
What is 1961 in Roman numerals?
MCMLXI.
Is 1961 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 1961?
1961 is a semiprime: 37 × 53, the product of two primes.