The number 52641
52641 is a composite number with 6 divisors. Its prime factorisation is × 5849. Divisors (6): 1, 3, 9, 5849, 17547, 52641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52641: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
52641 is composite. Its prime factorisation is
- 3
The divisors add up to 76050; without 52641 itself that is 23409, so 52641 is deficient (23409 is less than 52641). Euler's totient φ(52641) = 35088 numbers up to 52641 share no factor with it.
- 4
The digits of 52641 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52641 = 3^{2} \times 5849 \]52641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 76050 |
| Euler totient φ(n) | 35088 |
| Square | 2771074881 |
| Cube | 145872152810721 |
| Square root | 229.436266 (= 3√5849) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.2641 × |
52641 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand six hundred and forty-one |
| Binary (base 2) | 1100110110100001 |
| Octal (base 8) | 146641 |
| Hexadecimal (base 16) | CDA1 |
| Base 3 | 2200012200 |
| As time | 52641 seconds = 14 h 37 min 21 s |
Is 52641 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (52641 ÷ 3 = 17547) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (52641 ÷ 9 = 5849) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52641 a prime number?
No. 52641 = × 5849, so it is divisible by 3.
What are the factors of 52641?
1, 3, 9, 5849, 17547, 52641.
What is 52641 in binary?
1100110110100001 (hexadecimal CDA1, octal 146641).
What is the square root of 52641?
About 229.4363, exactly 3√5849.
Is 52641 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 52641?
52641 is a happy number: repeatedly adding the squares of its digits reaches 1.