The number 14368
14368 is a composite number with 12 divisors. Its prime factorisation is × 449. Divisors (12): 1, 2, 4, 8, 16, 32, 449, 898, 1796, 3592, 7184, 14368.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14368 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14368 is composite. Its prime factorisation is
- 3
The divisors add up to 28350; without 14368 itself that is 13982, so 14368 is deficient (13982 is less than 14368). Euler's totient φ(14368) = 7168 numbers up to 14368 share no factor with it.
- 4
The digits of 14368 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14368 = 2^{5} \times 449 \]14368 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 28350 |
| Euler totient φ(n) | 7168 |
| Square | 206439424 |
| Cube | 2966121644032 |
| Square root | 119.866593 (= 4√898) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 120 |
| Scientific notation | 1.4368 × |
14368 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand three hundred and sixty-eight |
| Binary (base 2) | 11100000100000 |
| Octal (base 8) | 34040 |
| Hexadecimal (base 16) | 3820 |
| Base 3 | 201201011 |
| As time | 14368 seconds = 3 h 59 min 28 s |
Is 14368 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14368 ÷ 2 = 7184) | 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 | Yes (14368 ÷ 4 = 3592) | 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 4) | 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 | Yes (14368 ÷ 8 = 1796) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14368 a prime number?
No. 14368 = × 449, so it is divisible by 2.
What are the factors of 14368?
1, 2, 4, 8, 16, 32, 449, 898, 1796, 3592, 7184, 14368.
What is 14368 in binary?
11100000100000 (hexadecimal 3820, octal 34040).
What is the square root of 14368?
About 119.8666, exactly 4√898.
Is 14368 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 14368?
It is a composite number with 12 divisors.