The number 12436
12436 is a composite number with 6 divisors. Its prime factorisation is × 3109. Divisors (6): 1, 2, 4, 3109, 6218, 12436.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12436 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12436 is composite. Its prime factorisation is
- 3
The divisors add up to 21770; without 12436 itself that is 9334, so 12436 is deficient (9334 is less than 12436). Euler's totient φ(12436) = 6216 numbers up to 12436 share no factor with it.
- 4
The digits of 12436 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12436 = 2^{2} \times 3109 \]12436 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 21770 |
| Euler totient φ(n) | 6216 |
| Square | 154654096 |
| Cube | 1923278337856 |
| Square root | 111.516815 (= 2√3109) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 37 |
| Scientific notation | 1.2436 × |
12436 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand four hundred and thirty-six |
| Binary (base 2) | 11000010010100 |
| Octal (base 8) | 30224 |
| Hexadecimal (base 16) | 3094 |
| Base 3 | 122001121 |
| As time | 12436 seconds = 3 h 27 min 16 s |
Is 12436 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12436 ÷ 2 = 6218) | 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 (12436 ÷ 4 = 3109) | 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 | 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 7) | 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 6) | 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 12436 a prime number?
No. 12436 = × 3109, so it is divisible by 2.
What are the factors of 12436?
1, 2, 4, 3109, 6218, 12436.
What is 12436 in binary?
11000010010100 (hexadecimal 3094, octal 30224).
What is the square root of 12436?
About 111.5168, exactly 2√3109.
Is 12436 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 12436?
It is a composite number with 6 divisors.