The number 5962
5962 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 271. Divisors (8): 1, 2, 11, 22, 271, 542, 2981, 5962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5962: a Harshad number: divisible by its digit sum 22.
- 2
5962 is composite. Its prime factorisation is
- 3
The divisors add up to 9792; without 5962 itself that is 3830, so 5962 is deficient (3830 is less than 5962). Euler's totient φ(5962) = 2700 numbers up to 5962 share no factor with it.
- 4
The digits of 5962 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 93 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5962 = 2 \times 11 \times 271 \]
5962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 9792 |
| Euler totient φ(n) | 2700 |
| Square | 35545444 |
| Cube | 211921937128 |
| Square root | 77.213988 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 93 |
| Scientific notation | 5.962 × |
5962 in other forms
| Form | Value |
|---|---|
| In words | five thousand nine hundred and sixty-two |
| Binary (base 2) | 1011101001010 |
| Octal (base 8) | 13512 |
| Hexadecimal (base 16) | 174A |
| Base 3 | 22011211 |
| As time | 5962 seconds = 1 h 39 min 22 s |
Is 5962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5962 ÷ 2 = 2981) | 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 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 4) | 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 | Yes (5962 ÷ 11 = 542) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5962 a prime number?
No. 5962 = 2 × 11 × 271, so it is divisible by 2.
What are the factors of 5962?
1, 2, 11, 22, 271, 542, 2981, 5962.
What is 5962 in binary?
1011101001010 (hexadecimal 174A, octal 13512).
What is the square root of 5962?
About 77.2140.
Is 5962 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 5962?
5962 is a Harshad number: divisible by its digit sum 22.