The number 53062
53062 is a composite number with 8 divisors. Its prime factorisation is 2 × 43 × 617. Divisors (8): 1, 2, 43, 86, 617, 1234, 26531, 53062.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53062 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53062 is composite. Its prime factorisation is
- 3
The divisors add up to 81576; without 53062 itself that is 28514, so 53062 is deficient (28514 is less than 53062). Euler's totient φ(53062) = 25872 numbers up to 53062 share no factor with it.
- 4
The digits of 53062 add up to 16, 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
\[ 53062 = 2 \times 43 \times 617 \]
53062 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 81576 |
| Euler totient φ(n) | 25872 |
| Square | 2815575844 |
| Cube | 149400085434328 |
| Square root | 230.351905 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3062 × |
53062 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and sixty-two |
| Binary (base 2) | 1100111101000110 |
| Octal (base 8) | 147506 |
| Hexadecimal (base 16) | CF46 |
| Base 3 | 2200210021 |
| As time | 53062 seconds = 14 h 44 min 22 s |
Is 53062 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53062 ÷ 2 = 26531) | 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 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 6) | 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 9) | 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 53062 a prime number?
No. 53062 = 2 × 43 × 617, so it is divisible by 2.
What are the factors of 53062?
1, 2, 43, 86, 617, 1234, 26531, 53062.
What is 53062 in binary?
1100111101000110 (hexadecimal CF46, octal 147506).
What is the square root of 53062?
About 230.3519.
Is 53062 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 53062?
It is a composite number with 8 divisors.