The number 12141
12141 is a composite number with 12 divisors. Its prime factorisation is × 19 × 71. Divisors (12): 1, 3, 9, 19, 57, 71, 171, 213, 639, 1349, 4047, 12141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12141: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.
- 2
12141 is composite. Its prime factorisation is
- 3
The divisors add up to 18720; without 12141 itself that is 6579, so 12141 is deficient (6579 is less than 12141). Euler's totient φ(12141) = 7560 numbers up to 12141 share no factor with it.
- 4
The digits of 12141 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 156 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12141 = 3^{2} \times 19 \times 71 \]12141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 18720 |
| Euler totient φ(n) | 7560 |
| Square | 147403881 |
| Cube | 1789630519221 |
| Square root | 110.186206 (= 3√1349) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 156 |
| Scientific notation | 1.2141 × |
12141 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand one hundred and forty-one |
| Binary (base 2) | 10111101101101 |
| Octal (base 8) | 27555 |
| Hexadecimal (base 16) | 2F6D |
| Base 3 | 121122200 |
| As time | 12141 seconds = 3 h 22 min 21 s |
Is 12141 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 (12141 ÷ 3 = 4047) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (12141 ÷ 9 = 1349) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12141 a prime number?
No. 12141 = × 19 × 71, so it is divisible by 3.
What are the factors of 12141?
1, 3, 9, 19, 57, 71, 171, 213, 639, 1349, 4047, 12141.
What is 12141 in binary?
10111101101101 (hexadecimal 2F6D, octal 27555).
What is the square root of 12141?
About 110.1862, exactly 3√1349.
Is 12141 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 12141?
12141 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.