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