The number 14141
14141 is a palindrome: it reads 14141 backwards too. Its prime factorisation is 79 × 179. Divisors (4): 1, 79, 179, 14141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14141: a palindrome: it reads 14141 backwards too; a semiprime: 79 × 179, the product of two primes.
- 2
14141 is composite. Its prime factorisation is
- 3
The divisors add up to 14400; without 14141 itself that is 259, so 14141 is deficient (259 is less than 14141). Euler's totient φ(14141) = 13884 numbers up to 14141 share no factor with it.
- 4
The digits of 14141 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14141 = 79 \times 179 \]
14141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14400 |
| Euler totient φ(n) | 13884 |
| Square | 199967881 |
| Cube | 2827745805221 |
| Square root | 118.915937 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 151 |
| Scientific notation | 1.4141 × |
14141 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand one hundred and forty-one |
| Binary (base 2) | 11011100111101 |
| Octal (base 8) | 33475 |
| Hexadecimal (base 16) | 373D |
| Base 3 | 201101202 |
| As time | 14141 seconds = 3 h 55 min 41 s |
Is 14141 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 | No (remainder 2) | 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 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14141 a prime number?
No. 14141 = 79 × 179, so it is divisible by 79.
What are the factors of 14141?
1, 79, 179, 14141.
What is 14141 in binary?
11011100111101 (hexadecimal 373D, octal 33475).
What is the square root of 14141?
About 118.9159.
Is 14141 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 14141?
14141 is a palindrome: it reads 14141 backwards too; a semiprime: 79 × 179, the product of two primes.