The number 14363
14363 is a composite number with 4 divisors. Its prime factorisation is 53 × 271. Divisors (4): 1, 53, 271, 14363.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14363: a semiprime: 53 × 271, the product of two primes.
- 2
14363 is composite. Its prime factorisation is
- 3
The divisors add up to 14688; without 14363 itself that is 325, so 14363 is deficient (325 is less than 14363). Euler's totient φ(14363) = 14040 numbers up to 14363 share no factor with it.
- 4
The digits of 14363 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 195 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14363 = 53 \times 271 \]
14363 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14688 |
| Euler totient φ(n) | 14040 |
| Square | 206295769 |
| Cube | 2963026130147 |
| Square root | 119.845734 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 195 |
| Scientific notation | 1.4363 × |
14363 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand three hundred and sixty-three |
| Binary (base 2) | 11100000011011 |
| Octal (base 8) | 34033 |
| Hexadecimal (base 16) | 381B |
| Base 3 | 201200222 |
| As time | 14363 seconds = 3 h 59 min 23 s |
Is 14363 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 | No (remainder 2) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 3) | 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 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14363 a prime number?
No. 14363 = 53 × 271, so it is divisible by 53.
What are the factors of 14363?
1, 53, 271, 14363.
What is 14363 in binary?
11100000011011 (hexadecimal 381B, octal 34033).
What is the square root of 14363?
About 119.8457.
Is 14363 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 14363?
14363 is a semiprime: 53 × 271, the product of two primes.