The number 14121
14121 is a composite number with 8 divisors. Its prime factorisation is × 523. Divisors (8): 1, 3, 9, 27, 523, 1569, 4707, 14121.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14121: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.
- 2
14121 is composite. Its prime factorisation is
- 3
The divisors add up to 20960; without 14121 itself that is 6839, so 14121 is deficient (6839 is less than 14121). Euler's totient φ(14121) = 9396 numbers up to 14121 share no factor with it.
- 4
The digits of 14121 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 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14121 = 3^{3} \times 523 \]14121 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 20960 |
| Euler totient φ(n) | 9396 |
| Square | 199402641 |
| Cube | 2815764693561 |
| Square root | 118.831814 (= 3√1569) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 151 |
| Scientific notation | 1.4121 × |
14121 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand one hundred and twenty-one |
| Binary (base 2) | 11011100101001 |
| Octal (base 8) | 33451 |
| Hexadecimal (base 16) | 3729 |
| Base 3 | 201101000 |
| As time | 14121 seconds = 3 h 55 min 21 s |
Is 14121 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 (14121 ÷ 3 = 4707) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (14121 ÷ 9 = 1569) | 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 14121 a prime number?
No. 14121 = × 523, so it is divisible by 3.
What are the factors of 14121?
1, 3, 9, 27, 523, 1569, 4707, 14121.
What is 14121 in binary?
11011100101001 (hexadecimal 3729, octal 33451).
What is the square root of 14121?
About 118.8318, exactly 3√1569.
Is 14121 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 14121?
14121 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.