The number 12110
12110 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 7 × 173. Divisors (16): 1, 2, 5, 7, 10, 14, 35, 70, 173, 346, 865, 1211, 1730, 2422, 6055, 12110.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12110: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 5.
- 2
12110 is composite. Its prime factorisation is
- 3
The divisors add up to 25056; without 12110 itself that is 12946, so 12110 is abundant (12946 is more than 12110). Euler's totient φ(12110) = 4128 numbers up to 12110 share no factor with it.
- 4
The digits of 12110 add up to 5, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12110 = 2 \times 5 \times 7 \times 173 \]
12110 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 25056 |
| Euler totient φ(n) | 4128 |
| Square | 146652100 |
| Cube | 1775956931000 |
| Square root | 110.045445 |
| Digit sum / digital root | 5 / 5 |
| Collatz steps to 1 | 94 |
| Scientific notation | 1.211 × |
12110 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand one hundred and ten |
| Binary (base 2) | 10111101001110 |
| Octal (base 8) | 27516 |
| Hexadecimal (base 16) | 2F4E |
| Base 3 | 121121112 |
| As time | 12110 seconds = 3 h 21 min 50 s |
Is 12110 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12110 ÷ 2 = 6055) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (12110 ÷ 5 = 2422) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (12110 ÷ 7 = 1730) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (12110 ÷ 10 = 1211) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12110 a prime number?
No. 12110 = 2 × 5 × 7 × 173, so it is divisible by 2.
What are the factors of 12110?
1, 2, 5, 7, 10, 14, 35, 70, 173, 346, 865, 1211, 1730, 2422, 6055, 12110.
What is 12110 in binary?
10111101001110 (hexadecimal 2F4E, octal 27516).
What is the square root of 12110?
About 110.0454.
Is 12110 divisible by 3?
No. Its digits add up to 5, which is not a multiple of 3.
What is special about the number 12110?
12110 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 5.