The number 11252
11252 is a composite number with 12 divisors. Its prime factorisation is × 29 × 97. Divisors (12): 1, 2, 4, 29, 58, 97, 116, 194, 388, 2813, 5626, 11252.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11252 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11252 is composite. Its prime factorisation is
- 3
The divisors add up to 20580; without 11252 itself that is 9328, so 11252 is deficient (9328 is less than 11252). Euler's totient φ(11252) = 5376 numbers up to 11252 share no factor with it.
- 4
The digits of 11252 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11252 = 2^{2} \times 29 \times 97 \]11252 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 20580 |
| Euler totient φ(n) | 5376 |
| Square | 126607504 |
| Cube | 1424587635008 |
| Square root | 106.075445 (= 2√2813) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 174 |
| Scientific notation | 1.1252 × |
11252 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand two hundred and fifty-two |
| Binary (base 2) | 10101111110100 |
| Octal (base 8) | 25764 |
| Hexadecimal (base 16) | 2BF4 |
| Base 3 | 120102202 |
| As time | 11252 seconds = 3 h 7 min 32 s |
Is 11252 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11252 ÷ 2 = 5626) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (11252 ÷ 4 = 2813) | 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 2) | 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 2) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11252 a prime number?
No. 11252 = × 29 × 97, so it is divisible by 2.
What are the factors of 11252?
1, 2, 4, 29, 58, 97, 116, 194, 388, 2813, 5626, 11252.
What is 11252 in binary?
10101111110100 (hexadecimal 2BF4, octal 25764).
What is the square root of 11252?
About 106.0754, exactly 2√2813.
Is 11252 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 11252?
It is a composite number with 12 divisors.