The number 63252
63252 is a composite number with 36 divisors. Its prime factorisation is × × 7 × 251. Divisors (36): 1, 2, 3, 4, 6, 7, 9, 12, 14, 18, 21, 28, 36, 42, 63, 84 … 63252.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63252: a Harshad number: divisible by its digit sum 18.
- 2
63252 is composite. Its prime factorisation is
- 3
The divisors add up to 183456; without 63252 itself that is 120204, so 63252 is abundant (120204 is more than 63252). Euler's totient φ(63252) = 18000 numbers up to 63252 share no factor with it.
- 4
The digits of 63252 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 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63252 = 2^{2} \times 3^{2} \times 7 \times 251 \]63252 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 183456 |
| Euler totient φ(n) | 18000 |
| Square | 4000815504 |
| Cube | 253059582259008 |
| Square root | 251.499503 (= 6√1757) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.3252 × |
63252 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand two hundred and fifty-two |
| Binary (base 2) | 1111011100010100 |
| Octal (base 8) | 173424 |
| Hexadecimal (base 16) | F714 |
| Base 3 | 10012202200 |
| As time | 63252 seconds = 17 h 34 min 12 s |
Is 63252 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63252 ÷ 2 = 31626) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (63252 ÷ 3 = 21084) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (63252 ÷ 4 = 15813) | 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 (63252 ÷ 6 = 10542) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (63252 ÷ 7 = 9036) | 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 (63252 ÷ 9 = 7028) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (63252 ÷ 12 = 5271) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63252 a prime number?
No. 63252 = × × 7 × 251, so it is divisible by 2.
What are the factors of 63252?
1, 2, 3, 4, 6, 7, 9, 12, 14, 18, 21, 28, 36, 42, 63, 84, 126, 251, 252, 502, 753, 1004, 1506, 1757, 2259, 3012, 3514, 4518, 5271, 7028, 9036, 10542, 15813, 21084, 31626, 63252.
What is 63252 in binary?
1111011100010100 (hexadecimal F714, octal 173424).
What is the square root of 63252?
About 251.4995, exactly 6√1757.
Is 63252 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 63252?
63252 is a Harshad number: divisible by its digit sum 18.