The number 12678
12678 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 2113. Divisors (8): 1, 2, 3, 6, 2113, 4226, 6339, 12678.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12678 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12678 is composite. Its prime factorisation is
- 3
The divisors add up to 25368; without 12678 itself that is 12690, so 12678 is abundant (12690 is more than 12678). Euler's totient φ(12678) = 4224 numbers up to 12678 share no factor with it.
- 4
The digits of 12678 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12678 = 2 \times 3 \times 2113 \]
12678 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 25368 |
| Euler totient φ(n) | 4224 |
| Square | 160731684 |
| Cube | 2037756289752 |
| Square root | 112.596625 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.2678 × |
12678 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand six hundred and seventy-eight |
| Binary (base 2) | 11000110000110 |
| Octal (base 8) | 30606 |
| Hexadecimal (base 16) | 3186 |
| Base 3 | 122101120 |
| As time | 12678 seconds = 3 h 31 min 18 s |
Is 12678 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12678 ÷ 2 = 6339) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (12678 ÷ 3 = 4226) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (12678 ÷ 6 = 2113) | 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 | No (remainder 6) | 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 8) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12678 a prime number?
No. 12678 = 2 × 3 × 2113, so it is divisible by 2.
What are the factors of 12678?
1, 2, 3, 6, 2113, 4226, 6339, 12678.
What is 12678 in binary?
11000110000110 (hexadecimal 3186, octal 30606).
What is the square root of 12678?
About 112.5966.
Is 12678 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 12678?
It is a composite number with 8 divisors.