The number 12608
12608 is a composite number with 14 divisors. Its prime factorisation is × 197. Divisors (14): 1, 2, 4, 8, 16, 32, 64, 197, 394, 788, 1576, 3152, 6304, 12608.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12608 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12608 is composite. Its prime factorisation is
- 3
The divisors add up to 25146; without 12608 itself that is 12538, so 12608 is deficient (12538 is less than 12608). Euler's totient φ(12608) = 6272 numbers up to 12608 share no factor with it.
- 4
The digits of 12608 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 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12608 = 2^{6} \times 197 \]12608 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 14 |
| Sum of divisors | 25146 |
| Euler totient φ(n) | 6272 |
| Square | 158961664 |
| Cube | 2004188659712 |
| Square root | 112.285351 (= 8√197) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 32 |
| Scientific notation | 1.2608 × |
12608 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand six hundred and eight |
| Binary (base 2) | 11000101000000 |
| Octal (base 8) | 30500 |
| Hexadecimal (base 16) | 3140 |
| Base 3 | 122021222 |
| As time | 12608 seconds = 3 h 30 min 8 s |
Is 12608 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12608 ÷ 2 = 6304) | 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 (12608 ÷ 4 = 3152) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 (12608 ÷ 8 = 1576) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 12608 a prime number?
No. 12608 = × 197, so it is divisible by 2.
What are the factors of 12608?
1, 2, 4, 8, 16, 32, 64, 197, 394, 788, 1576, 3152, 6304, 12608.
What is 12608 in binary?
11000101000000 (hexadecimal 3140, octal 30500).
What is the square root of 12608?
About 112.2854, exactly 8√197.
Is 12608 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 12608?
It is a composite number with 14 divisors.