The number 12536
12536 is a composite number with 8 divisors. Its prime factorisation is × 1567. Divisors (8): 1, 2, 4, 8, 1567, 3134, 6268, 12536.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12536 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12536 is composite. Its prime factorisation is
- 3
The divisors add up to 23520; without 12536 itself that is 10984, so 12536 is deficient (10984 is less than 12536). Euler's totient φ(12536) = 6264 numbers up to 12536 share no factor with it.
- 4
The digits of 12536 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12536 = 2^{3} \times 1567 \]12536 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 23520 |
| Euler totient φ(n) | 6264 |
| Square | 157151296 |
| Cube | 1970048646656 |
| Square root | 111.964280 (= 2√3134) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.2536 × |
12536 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand five hundred and thirty-six |
| Binary (base 2) | 11000011111000 |
| Octal (base 8) | 30370 |
| Hexadecimal (base 16) | 30F8 |
| Base 3 | 122012022 |
| As time | 12536 seconds = 3 h 28 min 56 s |
Is 12536 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12536 ÷ 2 = 6268) | 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 (12536 ÷ 4 = 3134) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | Yes (12536 ÷ 8 = 1567) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12536 a prime number?
No. 12536 = × 1567, so it is divisible by 2.
What are the factors of 12536?
1, 2, 4, 8, 1567, 3134, 6268, 12536.
What is 12536 in binary?
11000011111000 (hexadecimal 30F8, octal 30370).
What is the square root of 12536?
About 111.9643, exactly 2√3134.
Is 12536 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 12536?
It is a composite number with 8 divisors.