The number 14110
14110 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 17 × 83. Divisors (16): 1, 2, 5, 10, 17, 34, 83, 85, 166, 170, 415, 830, 1411, 2822, 7055, 14110.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14110: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
14110 is composite. Its prime factorisation is
- 3
The divisors add up to 27216; without 14110 itself that is 13106, so 14110 is deficient (13106 is less than 14110). Euler's totient φ(14110) = 5248 numbers up to 14110 share no factor with it.
- 4
The digits of 14110 add up to 7, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14110 = 2 \times 5 \times 17 \times 83 \]
14110 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 27216 |
| Euler totient φ(n) | 5248 |
| Square | 199092100 |
| Cube | 2809189531000 |
| Square root | 118.785521 |
| Digit sum / digital root | 7 / 7 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.411 × |
14110 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand one hundred and ten |
| Binary (base 2) | 11011100011110 |
| Octal (base 8) | 33436 |
| Hexadecimal (base 16) | 371E |
| Base 3 | 201100121 |
| As time | 14110 seconds = 3 h 55 min 10 s |
Is 14110 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14110 ÷ 2 = 7055) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 | Yes (14110 ÷ 5 = 2822) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (14110 ÷ 10 = 1411) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14110 a prime number?
No. 14110 = 2 × 5 × 17 × 83, so it is divisible by 2.
What are the factors of 14110?
1, 2, 5, 10, 17, 34, 83, 85, 166, 170, 415, 830, 1411, 2822, 7055, 14110.
What is 14110 in binary?
11011100011110 (hexadecimal 371E, octal 33436).
What is the square root of 14110?
About 118.7855.
Is 14110 divisible by 3?
No. Its digits add up to 7, which is not a multiple of 3.
What is special about the number 14110?
14110 is a happy number: repeatedly adding the squares of its digits reaches 1.