The number 52642
52642 is a composite number with 4 divisors. Its prime factorisation is 2 × 26321. Divisors (4): 1, 2, 26321, 52642.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52642: a semiprime: 2 × 26321, the product of two primes.
- 2
52642 is composite. Its prime factorisation is
- 3
The divisors add up to 78966; without 52642 itself that is 26324, so 52642 is deficient (26324 is less than 52642). Euler's totient φ(52642) = 26320 numbers up to 52642 share no factor with it.
- 4
The digits of 52642 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52642 = 2 \times 26321 \]
52642 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 78966 |
| Euler totient φ(n) | 26320 |
| Square | 2771180164 |
| Cube | 145880466193288 |
| Square root | 229.438445 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.2642 × |
52642 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand six hundred and forty-two |
| Binary (base 2) | 1100110110100010 |
| Octal (base 8) | 146642 |
| Hexadecimal (base 16) | CDA2 |
| Base 3 | 2200012201 |
| As time | 52642 seconds = 14 h 37 min 22 s |
Is 52642 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52642 ÷ 2 = 26321) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 52642 a prime number?
No. 52642 = 2 × 26321, so it is divisible by 2.
What are the factors of 52642?
1, 2, 26321, 52642.
What is 52642 in binary?
1100110110100010 (hexadecimal CDA2, octal 146642).
What is the square root of 52642?
About 229.4384.
Is 52642 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 52642?
52642 is a semiprime: 2 × 26321, the product of two primes.