The number 14367
14367 is a composite number with 4 divisors. Its prime factorisation is 3 × 4789. Divisors (4): 1, 3, 4789, 14367.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14367: a semiprime: 3 × 4789, the product of two primes.
- 2
14367 is composite. Its prime factorisation is
- 3
The divisors add up to 19160; without 14367 itself that is 4793, so 14367 is deficient (4793 is less than 14367). Euler's totient φ(14367) = 9576 numbers up to 14367 share no factor with it.
- 4
The digits of 14367 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14367 = 3 \times 4789 \]
14367 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 19160 |
| Euler totient φ(n) | 9576 |
| Square | 206410689 |
| Cube | 2965502368863 |
| Square root | 119.862421 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.4367 × |
14367 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand three hundred and sixty-seven |
| Binary (base 2) | 11100000011111 |
| Octal (base 8) | 34037 |
| Hexadecimal (base 16) | 381F |
| Base 3 | 201201010 |
| As time | 14367 seconds = 3 h 59 min 27 s |
Is 14367 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14367 ÷ 3 = 4789) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14367 a prime number?
No. 14367 = 3 × 4789, so it is divisible by 3.
What are the factors of 14367?
1, 3, 4789, 14367.
What is 14367 in binary?
11100000011111 (hexadecimal 381F, octal 34037).
What is the square root of 14367?
About 119.8624.
Is 14367 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 14367?
14367 is a semiprime: 3 × 4789, the product of two primes.