The number 36962
36962 is a composite number with 4 divisors. Its prime factorisation is 2 × 18481. Divisors (4): 1, 2, 18481, 36962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 36962: a semiprime: 2 × 18481, the product of two primes.
- 2
36962 is composite. Its prime factorisation is
- 3
The divisors add up to 55446; without 36962 itself that is 18484, so 36962 is deficient (18484 is less than 36962). Euler's totient φ(36962) = 18480 numbers up to 36962 share no factor with it.
- 4
The digits of 36962 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 155 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36962 = 2 \times 18481 \]
36962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 55446 |
| Euler totient φ(n) | 18480 |
| Square | 1366189444 |
| Cube | 50497094229128 |
| Square root | 192.255039 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 155 |
| Scientific notation | 3.6962 × |
36962 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand nine hundred and sixty-two |
| Binary (base 2) | 1001000001100010 |
| Octal (base 8) | 110142 |
| Hexadecimal (base 16) | 9062 |
| Base 3 | 1212200222 |
| As time | 36962 seconds = 10 h 16 min 2 s |
Is 36962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (36962 ÷ 2 = 18481) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 2) | 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 2) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36962 a prime number?
No. 36962 = 2 × 18481, so it is divisible by 2.
What are the factors of 36962?
1, 2, 18481, 36962.
What is 36962 in binary?
1001000001100010 (hexadecimal 9062, octal 110142).
What is the square root of 36962?
About 192.2550.
Is 36962 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 36962?
36962 is a semiprime: 2 × 18481, the product of two primes.