The number 11253
11253 is a binary palindrome (10101111110101). Its prime factorisation is 3 × × 31. Divisors (12): 1, 3, 11, 31, 33, 93, 121, 341, 363, 1023, 3751, 11253.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11253: a binary palindrome (10101111110101).
- 2
11253 is composite. Its prime factorisation is
- 3
The divisors add up to 17024; without 11253 itself that is 5771, so 11253 is deficient (5771 is less than 11253). Euler's totient φ(11253) = 6600 numbers up to 11253 share no factor with it.
- 4
The digits of 11253 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11253 = 3 \times 11^{2} \times 31 \]11253 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 17024 |
| Euler totient φ(n) | 6600 |
| Square | 126630009 |
| Cube | 1424967491277 |
| Square root | 106.080158 (= 11√93) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 174 |
| Scientific notation | 1.1253 × |
11253 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand two hundred and fifty-three |
| Binary (base 2) | 10101111110101 |
| Octal (base 8) | 25765 |
| Hexadecimal (base 16) | 2BF5 |
| Base 3 | 120102210 |
| As time | 11253 seconds = 3 h 7 min 33 s |
Is 11253 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11253 ÷ 3 = 3751) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (11253 ÷ 11 = 1023) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11253 a prime number?
No. 11253 = 3 × × 31, so it is divisible by 3.
What are the factors of 11253?
1, 3, 11, 31, 33, 93, 121, 341, 363, 1023, 3751, 11253.
What is 11253 in binary?
10101111110101 (hexadecimal 2BF5, octal 25765).
What is the square root of 11253?
About 106.0802, exactly 11√93.
Is 11253 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 11253?
11253 is a binary palindrome (10101111110101).