The number 14190
14190 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 11 × 43. Divisors (32): 1, 2, 3, 5, 6, 10, 11, 15, 22, 30, 33, 43, 55, 66, 86, 110 … 14190.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14190: a Harshad number: divisible by its digit sum 15.
- 2
14190 is composite. Its prime factorisation is
- 3
The divisors add up to 38016; without 14190 itself that is 23826, so 14190 is abundant (23826 is more than 14190). Euler's totient φ(14190) = 3360 numbers up to 14190 share no factor with it.
- 4
The digits of 14190 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14190 = 2 \times 3 \times 5 \times 11 \times 43 \]
14190 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 38016 |
| Euler totient φ(n) | 3360 |
| Square | 201356100 |
| Cube | 2857243059000 |
| Square root | 119.121786 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.419 × |
14190 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand one hundred and ninety |
| Binary (base 2) | 11011101101110 |
| Octal (base 8) | 33556 |
| Hexadecimal (base 16) | 376E |
| Base 3 | 201110120 |
| As time | 14190 seconds = 3 h 56 min 30 s |
Is 14190 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14190 ÷ 2 = 7095) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14190 ÷ 3 = 4730) | 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 (14190 ÷ 5 = 2838) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (14190 ÷ 6 = 2365) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (14190 ÷ 10 = 1419) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (14190 ÷ 11 = 1290) | 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 14190 a prime number?
No. 14190 = 2 × 3 × 5 × 11 × 43, so it is divisible by 2.
What are the factors of 14190?
1, 2, 3, 5, 6, 10, 11, 15, 22, 30, 33, 43, 55, 66, 86, 110, 129, 165, 215, 258, 330, 430, 473, 645, 946, 1290, 1419, 2365, 2838, 4730, 7095, 14190.
What is 14190 in binary?
11011101101110 (hexadecimal 376E, octal 33556).
What is the square root of 14190?
About 119.1218.
Is 14190 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 14190?
14190 is a Harshad number: divisible by its digit sum 15.