The number 53962
53962 is a composite number with 4 divisors. Its prime factorisation is 2 × 26981. Divisors (4): 1, 2, 26981, 53962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53962: a semiprime: 2 × 26981, the product of two primes.
- 2
53962 is composite. Its prime factorisation is
- 3
The divisors add up to 80946; without 53962 itself that is 26984, so 53962 is deficient (26984 is less than 53962). Euler's totient φ(53962) = 26980 numbers up to 53962 share no factor with it.
- 4
The digits of 53962 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 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53962 = 2 \times 26981 \]
53962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 80946 |
| Euler totient φ(n) | 26980 |
| Square | 2911897444 |
| Cube | 157131809873128 |
| Square root | 232.297223 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3962 × |
53962 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand nine hundred and sixty-two |
| Binary (base 2) | 1101001011001010 |
| Octal (base 8) | 151312 |
| Hexadecimal (base 16) | D2CA |
| Base 3 | 2202000121 |
| As time | 53962 seconds = 14 h 59 min 22 s |
Is 53962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53962 ÷ 2 = 26981) | 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 6) | 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 7) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53962 a prime number?
No. 53962 = 2 × 26981, so it is divisible by 2.
What are the factors of 53962?
1, 2, 26981, 53962.
What is 53962 in binary?
1101001011001010 (hexadecimal D2CA, octal 151312).
What is the square root of 53962?
About 232.2972.
Is 53962 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 53962?
53962 is a semiprime: 2 × 26981, the product of two primes.