The number 52330
52330 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5233. Divisors (8): 1, 2, 5, 10, 5233, 10466, 26165, 52330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52330 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52330 is composite. Its prime factorisation is
- 3
The divisors add up to 94212; without 52330 itself that is 41882, so 52330 is deficient (41882 is less than 52330). Euler's totient φ(52330) = 20928 numbers up to 52330 share no factor with it.
- 4
The digits of 52330 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52330 = 2 \times 5 \times 5233 \]
52330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 94212 |
| Euler totient φ(n) | 20928 |
| Square | 2738428900 |
| Cube | 143301984337000 |
| Square root | 228.757514 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.233 × |
52330 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand three hundred and thirty |
| Binary (base 2) | 1100110001101010 |
| Octal (base 8) | 146152 |
| Hexadecimal (base 16) | CC6A |
| Base 3 | 2122210011 |
| As time | 52330 seconds = 14 h 32 min 10 s |
Is 52330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52330 ÷ 2 = 26165) | 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 | Yes (52330 ÷ 5 = 10466) | 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 5) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (52330 ÷ 10 = 5233) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 52330 a prime number?
No. 52330 = 2 × 5 × 5233, so it is divisible by 2.
What are the factors of 52330?
1, 2, 5, 10, 5233, 10466, 26165, 52330.
What is 52330 in binary?
1100110001101010 (hexadecimal CC6A, octal 146152).
What is the square root of 52330?
About 228.7575.
Is 52330 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 52330?
It is a composite number with 8 divisors.