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