The number 11436
11436 is a composite number with 12 divisors. Its prime factorisation is × 3 × 953. Divisors (12): 1, 2, 3, 4, 6, 12, 953, 1906, 2859, 3812, 5718, 11436.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11436 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11436 is composite. Its prime factorisation is
- 3
The divisors add up to 26712; without 11436 itself that is 15276, so 11436 is abundant (15276 is more than 11436). Euler's totient φ(11436) = 3808 numbers up to 11436 share no factor with it.
- 4
The digits of 11436 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 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11436 = 2^{2} \times 3 \times 953 \]11436 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 26712 |
| Euler totient φ(n) | 3808 |
| Square | 130782096 |
| Cube | 1495624049856 |
| Square root | 106.939235 (= 2√2859) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.1436 × |
11436 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and thirty-six |
| Binary (base 2) | 10110010101100 |
| Octal (base 8) | 26254 |
| Hexadecimal (base 16) | 2CAC |
| Base 3 | 120200120 |
| As time | 11436 seconds = 3 h 10 min 36 s |
Is 11436 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11436 ÷ 2 = 5718) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11436 ÷ 3 = 3812) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (11436 ÷ 4 = 2859) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (11436 ÷ 6 = 1906) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (11436 ÷ 12 = 953) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11436 a prime number?
No. 11436 = × 3 × 953, so it is divisible by 2.
What are the factors of 11436?
1, 2, 3, 4, 6, 12, 953, 1906, 2859, 3812, 5718, 11436.
What is 11436 in binary?
10110010101100 (hexadecimal 2CAC, octal 26254).
What is the square root of 11436?
About 106.9392, exactly 2√2859.
Is 11436 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 11436?
It is a composite number with 12 divisors.