The number 14313
14313 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 367. Divisors (8): 1, 3, 13, 39, 367, 1101, 4771, 14313.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14313 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14313 is composite. Its prime factorisation is
- 3
The divisors add up to 20608; without 14313 itself that is 6295, so 14313 is deficient (6295 is less than 14313). Euler's totient φ(14313) = 8784 numbers up to 14313 share no factor with it.
- 4
The digits of 14313 add up to 12, 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
\[ 14313 = 3 \times 13 \times 367 \]
14313 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 20608 |
| Euler totient φ(n) | 8784 |
| Square | 204861969 |
| Cube | 2932189362297 |
| Square root | 119.636951 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.4313 × |
14313 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand three hundred and thirteen |
| Binary (base 2) | 11011111101001 |
| Octal (base 8) | 33751 |
| Hexadecimal (base 16) | 37E9 |
| Base 3 | 201122010 |
| As time | 14313 seconds = 3 h 58 min 33 s |
Is 14313 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 (14313 ÷ 3 = 4771) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | 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 1) | 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 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14313 a prime number?
No. 14313 = 3 × 13 × 367, so it is divisible by 3.
What are the factors of 14313?
1, 3, 13, 39, 367, 1101, 4771, 14313.
What is 14313 in binary?
11011111101001 (hexadecimal 37E9, octal 33751).
What is the square root of 14313?
About 119.6370.
Is 14313 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 14313?
It is a composite number with 8 divisors.