The number 14398
14398 is a composite number with 8 divisors. Its prime factorisation is 2 × 23 × 313. Divisors (8): 1, 2, 23, 46, 313, 626, 7199, 14398.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14398 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14398 is composite. Its prime factorisation is
- 3
The divisors add up to 22608; without 14398 itself that is 8210, so 14398 is deficient (8210 is less than 14398). Euler's totient φ(14398) = 6864 numbers up to 14398 share no factor with it.
- 4
The digits of 14398 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14398 = 2 \times 23 \times 313 \]
14398 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22608 |
| Euler totient φ(n) | 6864 |
| Square | 207302404 |
| Cube | 2984740012792 |
| Square root | 119.991666 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 164 |
| Scientific notation | 1.4398 × |
14398 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand three hundred and ninety-eight |
| Binary (base 2) | 11100000111110 |
| Octal (base 8) | 34076 |
| Hexadecimal (base 16) | 383E |
| Base 3 | 201202021 |
| As time | 14398 seconds = 3 h 59 min 58 s |
Is 14398 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14398 ÷ 2 = 7199) | 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 | No (remainder 3) | 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 6) | 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 | No (remainder 8) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14398 a prime number?
No. 14398 = 2 × 23 × 313, so it is divisible by 2.
What are the factors of 14398?
1, 2, 23, 46, 313, 626, 7199, 14398.
What is 14398 in binary?
11100000111110 (hexadecimal 383E, octal 34076).
What is the square root of 14398?
About 119.9917.
Is 14398 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 14398?
It is a composite number with 8 divisors.