The number 14390
14390 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1439. Divisors (8): 1, 2, 5, 10, 1439, 2878, 7195, 14390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14390 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14390 is composite. Its prime factorisation is
- 3
The divisors add up to 25920; without 14390 itself that is 11530, so 14390 is deficient (11530 is less than 14390). Euler's totient φ(14390) = 5752 numbers up to 14390 share no factor with it.
- 4
The digits of 14390 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14390 = 2 \times 5 \times 1439 \]
14390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 25920 |
| Euler totient φ(n) | 5752 |
| Square | 207072100 |
| Cube | 2979767519000 |
| Square root | 119.958326 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 120 |
| Scientific notation | 1.439 × |
14390 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand three hundred and ninety |
| Binary (base 2) | 11100000110110 |
| Octal (base 8) | 34066 |
| Hexadecimal (base 16) | 3836 |
| Base 3 | 201201222 |
| As time | 14390 seconds = 3 h 59 min 50 s |
Is 14390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14390 ÷ 2 = 7195) | 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 (14390 ÷ 5 = 2878) | 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 | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (14390 ÷ 10 = 1439) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 14390 a prime number?
No. 14390 = 2 × 5 × 1439, so it is divisible by 2.
What are the factors of 14390?
1, 2, 5, 10, 1439, 2878, 7195, 14390.
What is 14390 in binary?
11100000110110 (hexadecimal 3836, octal 34066).
What is the square root of 14390?
About 119.9583.
Is 14390 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 14390?
It is a composite number with 8 divisors.