The number 12159
12159 is a composite number with 12 divisors. Its prime factorisation is × 7 × 193. Divisors (12): 1, 3, 7, 9, 21, 63, 193, 579, 1351, 1737, 4053, 12159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12159 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12159 is composite. Its prime factorisation is
- 3
The divisors add up to 20176; without 12159 itself that is 8017, so 12159 is deficient (8017 is less than 12159). Euler's totient φ(12159) = 6912 numbers up to 12159 share no factor with it.
- 4
The digits of 12159 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12159 = 3^{2} \times 7 \times 193 \]12159 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 20176 |
| Euler totient φ(n) | 6912 |
| Square | 147841281 |
| Cube | 1797602135679 |
| Square root | 110.267856 (= 3√1351) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.2159 × |
12159 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand one hundred and fifty-nine |
| Binary (base 2) | 10111101111111 |
| Octal (base 8) | 27577 |
| Hexadecimal (base 16) | 2F7F |
| Base 3 | 121200100 |
| As time | 12159 seconds = 3 h 22 min 39 s |
Is 12159 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (12159 ÷ 3 = 4053) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (12159 ÷ 7 = 1737) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (12159 ÷ 9 = 1351) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12159 a prime number?
No. 12159 = × 7 × 193, so it is divisible by 3.
What are the factors of 12159?
1, 3, 7, 9, 21, 63, 193, 579, 1351, 1737, 4053, 12159.
What is 12159 in binary?
10111101111111 (hexadecimal 2F7F, octal 27577).
What is the square root of 12159?
About 110.2679, exactly 3√1351.
Is 12159 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 12159?
It is a composite number with 12 divisors.