The number 52551
52551 is a composite number with 6 divisors. Its prime factorisation is × 5839. Divisors (6): 1, 3, 9, 5839, 17517, 52551.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52551 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52551 is composite. Its prime factorisation is
- 3
The divisors add up to 75920; without 52551 itself that is 23369, so 52551 is deficient (23369 is less than 52551). Euler's totient φ(52551) = 35028 numbers up to 52551 share no factor with it.
- 4
The digits of 52551 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 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52551 = 3^{2} \times 5839 \]52551 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 75920 |
| Euler totient φ(n) | 35028 |
| Square | 2761607601 |
| Cube | 145125241040151 |
| Square root | 229.240049 (= 3√5839) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.2551 × |
52551 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand five hundred and fifty-one |
| Binary (base 2) | 1100110101000111 |
| Octal (base 8) | 146507 |
| Hexadecimal (base 16) | CD47 |
| Base 3 | 2200002100 |
| As time | 52551 seconds = 14 h 35 min 51 s |
Is 52551 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 (52551 ÷ 3 = 17517) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (52551 ÷ 9 = 5839) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52551 a prime number?
No. 52551 = × 5839, so it is divisible by 3.
What are the factors of 52551?
1, 3, 9, 5839, 17517, 52551.
What is 52551 in binary?
1100110101000111 (hexadecimal CD47, octal 146507).
What is the square root of 52551?
About 229.2400, exactly 3√5839.
Is 52551 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 52551?
It is a composite number with 6 divisors.