The number 14106
14106 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 2351. Divisors (8): 1, 2, 3, 6, 2351, 4702, 7053, 14106.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14106 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14106 is composite. Its prime factorisation is
- 3
The divisors add up to 28224; without 14106 itself that is 14118, so 14106 is abundant (14118 is more than 14106). Euler's totient φ(14106) = 4700 numbers up to 14106 share no factor with it.
- 4
The digits of 14106 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14106 = 2 \times 3 \times 2351 \]
14106 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 28224 |
| Euler totient φ(n) | 4700 |
| Square | 198979236 |
| Cube | 2806801103016 |
| Square root | 118.768683 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 120 |
| Scientific notation | 1.4106 × |
14106 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand one hundred and six |
| Binary (base 2) | 11011100011010 |
| Octal (base 8) | 33432 |
| Hexadecimal (base 16) | 371A |
| Base 3 | 201100110 |
| As time | 14106 seconds = 3 h 55 min 6 s |
Is 14106 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14106 ÷ 2 = 7053) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14106 ÷ 3 = 4702) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (14106 ÷ 6 = 2351) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14106 a prime number?
No. 14106 = 2 × 3 × 2351, so it is divisible by 2.
What are the factors of 14106?
1, 2, 3, 6, 2351, 4702, 7053, 14106.
What is 14106 in binary?
11011100011010 (hexadecimal 371A, octal 33432).
What is the square root of 14106?
About 118.7687.
Is 14106 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 14106?
It is a composite number with 8 divisors.