The number 63052
63052 is a composite number with 12 divisors. Its prime factorisation is × 11 × 1433. Divisors (12): 1, 2, 4, 11, 22, 44, 1433, 2866, 5732, 15763, 31526, 63052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
63052 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
63052 is composite. Its prime factorisation is
- 3
The divisors add up to 120456; without 63052 itself that is 57404, so 63052 is deficient (57404 is less than 63052). Euler's totient φ(63052) = 28640 numbers up to 63052 share no factor with it.
- 4
The digits of 63052 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63052 = 2^{2} \times 11 \times 1433 \]63052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 120456 |
| Euler totient φ(n) | 28640 |
| Square | 3975554704 |
| Cube | 250666675196608 |
| Square root | 251.101573 (= 2√15763) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 148 |
| Scientific notation | 6.3052 × |
63052 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand and fifty-two |
| Binary (base 2) | 1111011001001100 |
| Octal (base 8) | 173114 |
| Hexadecimal (base 16) | F64C |
| Base 3 | 10012111021 |
| As time | 63052 seconds = 17 h 30 min 52 s |
Is 63052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63052 ÷ 2 = 31526) | 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 | Yes (63052 ÷ 4 = 15763) | 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 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 | Yes (63052 ÷ 11 = 5732) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63052 a prime number?
No. 63052 = × 11 × 1433, so it is divisible by 2.
What are the factors of 63052?
1, 2, 4, 11, 22, 44, 1433, 2866, 5732, 15763, 31526, 63052.
What is 63052 in binary?
1111011001001100 (hexadecimal F64C, octal 173114).
What is the square root of 63052?
About 251.1016, exactly 2√15763.
Is 63052 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 63052?
It is a composite number with 12 divisors.