The number 31962
31962 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 7 × 761. Divisors (16): 1, 2, 3, 6, 7, 14, 21, 42, 761, 1522, 2283, 4566, 5327, 10654, 15981, 31962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 31962: a Harshad number: divisible by its digit sum 21.
- 2
31962 is composite. Its prime factorisation is
- 3
The divisors add up to 73152; without 31962 itself that is 41190, so 31962 is abundant (41190 is more than 31962). Euler's totient φ(31962) = 9120 numbers up to 31962 share no factor with it.
- 4
The digits of 31962 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 85 steps to reach 1.
LaTeX source of the formulas on this page
\[ 31962 = 2 \times 3 \times 7 \times 761 \]
31962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 73152 |
| Euler totient φ(n) | 9120 |
| Square | 1021569444 |
| Cube | 32651402569128 |
| Square root | 178.779193 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 85 |
| Scientific notation | 3.1962 × |
31962 in other forms
| Form | Value |
|---|---|
| In words | thirty-one thousand nine hundred and sixty-two |
| Binary (base 2) | 111110011011010 |
| Octal (base 8) | 76332 |
| Hexadecimal (base 16) | 7CDA |
| Base 3 | 1121211210 |
| As time | 31962 seconds = 8 h 52 min 42 s |
Is 31962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (31962 ÷ 2 = 15981) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (31962 ÷ 3 = 10654) | 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 | Yes (31962 ÷ 6 = 5327) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (31962 ÷ 7 = 4566) | 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 3) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 31962 a prime number?
No. 31962 = 2 × 3 × 7 × 761, so it is divisible by 2.
What are the factors of 31962?
1, 2, 3, 6, 7, 14, 21, 42, 761, 1522, 2283, 4566, 5327, 10654, 15981, 31962.
What is 31962 in binary?
111110011011010 (hexadecimal 7CDA, octal 76332).
What is the square root of 31962?
About 178.7792.
Is 31962 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 31962?
31962 is a Harshad number: divisible by its digit sum 21.