The number 52592
52592 is a composite number with 20 divisors. Its prime factorisation is × 19 × 173. Divisors (20): 1, 2, 4, 8, 16, 19, 38, 76, 152, 173, 304, 346, 692, 1384, 2768, 3287 … 52592.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52592: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
52592 is composite. Its prime factorisation is
- 3
The divisors add up to 107880; without 52592 itself that is 55288, so 52592 is abundant (55288 is more than 52592). Euler's totient φ(52592) = 24768 numbers up to 52592 share no factor with it.
- 4
The digits of 52592 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52592 = 2^{4} \times 19 \times 173 \]52592 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 107880 |
| Euler totient φ(n) | 24768 |
| Square | 2765918464 |
| Cube | 145465183858688 |
| Square root | 229.329457 (= 4√3287) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.2592 × |
52592 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand five hundred and ninety-two |
| Binary (base 2) | 1100110101110000 |
| Octal (base 8) | 146560 |
| Hexadecimal (base 16) | CD70 |
| Base 3 | 2200010212 |
| As time | 52592 seconds = 14 h 36 min 32 s |
Is 52592 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52592 ÷ 2 = 26296) | 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 | Yes (52592 ÷ 4 = 13148) | 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 2) | 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 | Yes (52592 ÷ 8 = 6574) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52592 a prime number?
No. 52592 = × 19 × 173, so it is divisible by 2.
What are the factors of 52592?
1, 2, 4, 8, 16, 19, 38, 76, 152, 173, 304, 346, 692, 1384, 2768, 3287, 6574, 13148, 26296, 52592.
What is 52592 in binary?
1100110101110000 (hexadecimal CD70, octal 146560).
What is the square root of 52592?
About 229.3295, exactly 4√3287.
Is 52592 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 52592?
52592 is a happy number: repeatedly adding the squares of its digits reaches 1.