The number 65052
65052 is a composite number with 36 divisors. Its prime factorisation is × × 13 × 139. Divisors (36): 1, 2, 3, 4, 6, 9, 12, 13, 18, 26, 36, 39, 52, 78, 117, 139 … 65052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 65052: a Harshad number: divisible by its digit sum 18.
- 2
65052 is composite. Its prime factorisation is
- 3
The divisors add up to 178360; without 65052 itself that is 113308, so 65052 is abundant (113308 is more than 65052). Euler's totient φ(65052) = 19872 numbers up to 65052 share no factor with it.
- 4
The digits of 65052 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 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65052 = 2^{2} \times 3^{2} \times 13 \times 139 \]65052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 178360 |
| Euler totient φ(n) | 19872 |
| Square | 4231762704 |
| Cube | 275284627420608 |
| Square root | 255.052936 (= 6√1807) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 42 |
| Scientific notation | 6.5052 × |
65052 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand and fifty-two |
| Binary (base 2) | 1111111000011100 |
| Octal (base 8) | 177034 |
| Hexadecimal (base 16) | FE1C |
| Base 3 | 10022020100 |
| As time | 65052 seconds = 18 h 4 min 12 s |
Is 65052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (65052 ÷ 2 = 32526) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (65052 ÷ 3 = 21684) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (65052 ÷ 4 = 16263) | 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 | Yes (65052 ÷ 6 = 10842) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (65052 ÷ 9 = 7228) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (65052 ÷ 12 = 5421) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 65052 a prime number?
No. 65052 = × × 13 × 139, so it is divisible by 2.
What are the factors of 65052?
1, 2, 3, 4, 6, 9, 12, 13, 18, 26, 36, 39, 52, 78, 117, 139, 156, 234, 278, 417, 468, 556, 834, 1251, 1668, 1807, 2502, 3614, 5004, 5421, 7228, 10842, 16263, 21684, 32526, 65052.
What is 65052 in binary?
1111111000011100 (hexadecimal FE1C, octal 177034).
What is the square root of 65052?
About 255.0529, exactly 6√1807.
Is 65052 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 65052?
65052 is a Harshad number: divisible by its digit sum 18.