The number 12147
12147 is a composite number with 4 divisors. Its prime factorisation is 3 × 4049. Divisors (4): 1, 3, 4049, 12147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12147: a semiprime: 3 × 4049, the product of two primes.
- 2
12147 is composite. Its prime factorisation is
- 3
The divisors add up to 16200; without 12147 itself that is 4053, so 12147 is deficient (4053 is less than 12147). Euler's totient φ(12147) = 8096 numbers up to 12147 share no factor with it.
- 4
The digits of 12147 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12147 = 3 \times 4049 \]
12147 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16200 |
| Euler totient φ(n) | 8096 |
| Square | 147549609 |
| Cube | 1792285100523 |
| Square root | 110.213429 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.2147 × |
12147 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand one hundred and forty-seven |
| Binary (base 2) | 10111101110011 |
| Octal (base 8) | 27563 |
| Hexadecimal (base 16) | 2F73 |
| Base 3 | 121122220 |
| As time | 12147 seconds = 3 h 22 min 27 s |
Is 12147 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 (12147 ÷ 3 = 4049) | 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 2) | 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 | No (remainder 2) | 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 3) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 12147 a prime number?
No. 12147 = 3 × 4049, so it is divisible by 3.
What are the factors of 12147?
1, 3, 4049, 12147.
What is 12147 in binary?
10111101110011 (hexadecimal 2F73, octal 27563).
What is the square root of 12147?
About 110.2134.
Is 12147 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 12147?
12147 is a semiprime: 3 × 4049, the product of two primes.