The number 14490
14490 is a composite number with 48 divisors. Its prime factorisation is 2 × × 5 × 7 × 23. Divisors (48): 1, 2, 3, 5, 6, 7, 9, 10, 14, 15, 18, 21, 23, 30, 35, 42 … 14490.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14490: a Harshad number: divisible by its digit sum 18.
- 2
14490 is composite. Its prime factorisation is
- 3
The divisors add up to 44928; without 14490 itself that is 30438, so 14490 is abundant (30438 is more than 14490). Euler's totient φ(14490) = 3168 numbers up to 14490 share no factor with it.
- 4
The digits of 14490 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14490 = 2 \times 3^{2} \times 5 \times 7 \times 23 \]14490 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 44928 |
| Euler totient φ(n) | 3168 |
| Square | 209960100 |
| Cube | 3042321849000 |
| Square root | 120.374416 (= 3√1610) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.449 × |
14490 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand four hundred and ninety |
| Binary (base 2) | 11100010011010 |
| Octal (base 8) | 34232 |
| Hexadecimal (base 16) | 389A |
| Base 3 | 201212200 |
| As time | 14490 seconds = 4 h 1 min 30 s |
Is 14490 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14490 ÷ 2 = 7245) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14490 ÷ 3 = 4830) | 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 (14490 ÷ 5 = 2898) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (14490 ÷ 6 = 2415) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (14490 ÷ 7 = 2070) | 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 | Yes (14490 ÷ 9 = 1610) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (14490 ÷ 10 = 1449) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 14490 a prime number?
No. 14490 = 2 × × 5 × 7 × 23, so it is divisible by 2.
What are the factors of 14490?
1, 2, 3, 5, 6, 7, 9, 10, 14, 15, 18, 21, 23, 30, 35, 42, 45, 46, 63, 69, 70, 90, 105, 115, 126, 138, 161, 207, 210, 230, 315, 322, 345, 414, 483, 630, 690, 805, 966, 1035, 1449, 1610, 2070, 2415, 2898, 4830, 7245, 14490.
What is 14490 in binary?
11100010011010 (hexadecimal 389A, octal 34232).
What is the square root of 14490?
About 120.3744, exactly 3√1610.
Is 14490 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 14490?
14490 is a Harshad number: divisible by its digit sum 18.