The number 10252
10252 is a composite number with 12 divisors. Its prime factorisation is × 11 × 233. Divisors (12): 1, 2, 4, 11, 22, 44, 233, 466, 932, 2563, 5126, 10252.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10252 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10252 is composite. Its prime factorisation is
- 3
The divisors add up to 19656; without 10252 itself that is 9404, so 10252 is deficient (9404 is less than 10252). Euler's totient φ(10252) = 4640 numbers up to 10252 share no factor with it.
- 4
The digits of 10252 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10252 = 2^{2} \times 11 \times 233 \]10252 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 19656 |
| Euler totient φ(n) | 4640 |
| Square | 105103504 |
| Cube | 1077521123008 |
| Square root | 101.252160 (= 2√2563) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.0252 × |
10252 in other forms
| Form | Value |
|---|---|
| In words | ten thousand two hundred and fifty-two |
| Binary (base 2) | 10100000001100 |
| Octal (base 8) | 24014 |
| Hexadecimal (base 16) | 280C |
| Base 3 | 112001201 |
| As time | 10252 seconds = 2 h 50 min 52 s |
Is 10252 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10252 ÷ 2 = 5126) | 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 (10252 ÷ 4 = 2563) | 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 4) | 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 1) | 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 (10252 ÷ 11 = 932) | 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 10252 a prime number?
No. 10252 = × 11 × 233, so it is divisible by 2.
What are the factors of 10252?
1, 2, 4, 11, 22, 44, 233, 466, 932, 2563, 5126, 10252.
What is 10252 in binary?
10100000001100 (hexadecimal 280C, octal 24014).
What is the square root of 10252?
About 101.2522, exactly 2√2563.
Is 10252 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 10252?
It is a composite number with 12 divisors.