The number 14371
14371 is a composite number with 4 divisors. Its prime factorisation is 7 × 2053. Divisors (4): 1, 7, 2053, 14371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14371: a semiprime: 7 × 2053, the product of two primes.
- 2
14371 is composite. Its prime factorisation is
- 3
The divisors add up to 16432; without 14371 itself that is 2061, so 14371 is deficient (2061 is less than 14371). Euler's totient φ(14371) = 12312 numbers up to 14371 share no factor with it.
- 4
The digits of 14371 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14371 = 7 \times 2053 \]
14371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16432 |
| Euler totient φ(n) | 12312 |
| Square | 206525641 |
| Cube | 2967979986811 |
| Square root | 119.879106 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4371 × |
14371 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand three hundred and seventy-one |
| Binary (base 2) | 11100000100011 |
| Octal (base 8) | 34043 |
| Hexadecimal (base 16) | 3823 |
| Base 3 | 201201021 |
| As time | 14371 seconds = 3 h 59 min 31 s |
Is 14371 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 1) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (14371 ÷ 7 = 2053) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14371 a prime number?
No. 14371 = 7 × 2053, so it is divisible by 7.
What are the factors of 14371?
1, 7, 2053, 14371.
What is 14371 in binary?
11100000100011 (hexadecimal 3823, octal 34043).
What is the square root of 14371?
About 119.8791.
Is 14371 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 14371?
14371 is a semiprime: 7 × 2053, the product of two primes.