The number 6252
6252 is a composite number with 12 divisors. Its prime factorisation is × 3 × 521. Divisors (12): 1, 2, 3, 4, 6, 12, 521, 1042, 1563, 2084, 3126, 6252.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
6252 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
6252 is composite. Its prime factorisation is
- 3
The divisors add up to 14616; without 6252 itself that is 8364, so 6252 is abundant (8364 is more than 6252). Euler's totient φ(6252) = 2080 numbers up to 6252 share no factor with it.
- 4
The digits of 6252 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 155 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6252 = 2^{2} \times 3 \times 521 \]6252 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 14616 |
| Euler totient φ(n) | 2080 |
| Square | 39087504 |
| Cube | 244375075008 |
| Square root | 79.069590 (= 2√1563) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 155 |
| Scientific notation | 6.252 × |
6252 in other forms
| Form | Value |
|---|---|
| In words | six thousand two hundred and fifty-two |
| Binary (base 2) | 1100001101100 |
| Octal (base 8) | 14154 |
| Hexadecimal (base 16) | 186C |
| Base 3 | 22120120 |
| As time | 6252 seconds = 1 h 44 min 12 s |
Is 6252 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (6252 ÷ 2 = 3126) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (6252 ÷ 3 = 2084) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (6252 ÷ 4 = 1563) | 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 (6252 ÷ 6 = 1042) | 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 | No (remainder 6) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (6252 ÷ 12 = 521) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6252 a prime number?
No. 6252 = × 3 × 521, so it is divisible by 2.
What are the factors of 6252?
1, 2, 3, 4, 6, 12, 521, 1042, 1563, 2084, 3126, 6252.
What is 6252 in binary?
1100001101100 (hexadecimal 186C, octal 14154).
What is the square root of 6252?
About 79.0696, exactly 2√1563.
Is 6252 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 6252?
It is a composite number with 12 divisors.