The number 14111
14111 is a composite number with 4 divisors. Its prime factorisation is 103 × 137. Divisors (4): 1, 103, 137, 14111.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14111: a semiprime: 103 × 137, the product of two primes.
- 2
14111 is composite. Its prime factorisation is
- 3
The divisors add up to 14352; without 14111 itself that is 241, so 14111 is deficient (241 is less than 14111). Euler's totient φ(14111) = 13872 numbers up to 14111 share no factor with it.
- 4
The digits of 14111 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14111 = 103 \times 137 \]
14111 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14352 |
| Euler totient φ(n) | 13872 |
| Square | 199120321 |
| Cube | 2809786849631 |
| Square root | 118.789730 |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 107 |
| Scientific notation | 1.4111 × |
14111 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand one hundred and eleven |
| Binary (base 2) | 11011100011111 |
| Octal (base 8) | 33437 |
| Hexadecimal (base 16) | 371F |
| Base 3 | 201100122 |
| As time | 14111 seconds = 3 h 55 min 11 s |
Is 14111 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 3) | 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 6) | 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 | No (remainder 8) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14111 a prime number?
No. 14111 = 103 × 137, so it is divisible by 103.
What are the factors of 14111?
1, 103, 137, 14111.
What is 14111 in binary?
11011100011111 (hexadecimal 371F, octal 33437).
What is the square root of 14111?
About 118.7897.
Is 14111 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 14111?
14111 is a semiprime: 103 × 137, the product of two primes.