The number 36961
36961 is a composite number with 4 divisors. Its prime factorisation is 23 × 1607. Divisors (4): 1, 23, 1607, 36961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 36961: a semiprime: 23 × 1607, the product of two primes.
- 2
36961 is composite. Its prime factorisation is
- 3
The divisors add up to 38592; without 36961 itself that is 1631, so 36961 is deficient (1631 is less than 36961). Euler's totient φ(36961) = 35332 numbers up to 36961 share no factor with it.
- 4
The digits of 36961 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 93 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36961 = 23 \times 1607 \]
36961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 38592 |
| Euler totient φ(n) | 35332 |
| Square | 1366115521 |
| Cube | 50492995771681 |
| Square root | 192.252438 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 93 |
| Scientific notation | 3.6961 × |
36961 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand nine hundred and sixty-one |
| Binary (base 2) | 1001000001100001 |
| Octal (base 8) | 110141 |
| Hexadecimal (base 16) | 9061 |
| Base 3 | 1212200221 |
| As time | 36961 seconds = 10 h 16 min 1 s |
Is 36961 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 1) | 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 1) | 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 7) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36961 a prime number?
No. 36961 = 23 × 1607, so it is divisible by 23.
What are the factors of 36961?
1, 23, 1607, 36961.
What is 36961 in binary?
1001000001100001 (hexadecimal 9061, octal 110141).
What is the square root of 36961?
About 192.2524.
Is 36961 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 36961?
36961 is a semiprime: 23 × 1607, the product of two primes.