The number 5961
5961 is a composite number with 4 divisors. Its prime factorisation is 3 × 1987. Divisors (4): 1, 3, 1987, 5961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5961: a semiprime: 3 × 1987, the product of two primes.
- 2
5961 is composite. Its prime factorisation is
- 3
The divisors add up to 7952; without 5961 itself that is 1991, so 5961 is deficient (1991 is less than 5961). Euler's totient φ(5961) = 3972 numbers up to 5961 share no factor with it.
- 4
The digits of 5961 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 49 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5961 = 3 \times 1987 \]
5961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 7952 |
| Euler totient φ(n) | 3972 |
| Square | 35533521 |
| Cube | 211815318681 |
| Square root | 77.207513 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 49 |
| Scientific notation | 5.961 × |
5961 in other forms
| Form | Value |
|---|---|
| In words | five thousand nine hundred and sixty-one |
| Binary (base 2) | 1011101001001 |
| Octal (base 8) | 13511 |
| Hexadecimal (base 16) | 1749 |
| Base 3 | 22011210 |
| As time | 5961 seconds = 1 h 39 min 21 s |
Is 5961 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 (5961 ÷ 3 = 1987) | 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 4) | 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 10) | 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 5961 a prime number?
No. 5961 = 3 × 1987, so it is divisible by 3.
What are the factors of 5961?
1, 3, 1987, 5961.
What is 5961 in binary?
1011101001001 (hexadecimal 1749, octal 13511).
What is the square root of 5961?
About 77.2075.
Is 5961 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 5961?
5961 is a semiprime: 3 × 1987, the product of two primes.