The number 12371
12371 is a composite number with 4 divisors. Its prime factorisation is 89 × 139. Divisors (4): 1, 89, 139, 12371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12371: a semiprime: 89 × 139, the product of two primes.
- 2
12371 is composite. Its prime factorisation is
- 3
The divisors add up to 12600; without 12371 itself that is 229, so 12371 is deficient (229 is less than 12371). Euler's totient φ(12371) = 12144 numbers up to 12371 share no factor with it.
- 4
The digits of 12371 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12371 = 89 \times 139 \]
12371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12600 |
| Euler totient φ(n) | 12144 |
| Square | 153041641 |
| Cube | 1893278140811 |
| Square root | 111.224997 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 94 |
| Scientific notation | 1.2371 × |
12371 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand three hundred and seventy-one |
| Binary (base 2) | 11000001010011 |
| Octal (base 8) | 30123 |
| Hexadecimal (base 16) | 3053 |
| Base 3 | 121222012 |
| As time | 12371 seconds = 3 h 26 min 11 s |
Is 12371 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 1) | 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 2) | 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 5) | 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 7) | 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 12371 a prime number?
No. 12371 = 89 × 139, so it is divisible by 89.
What are the factors of 12371?
1, 89, 139, 12371.
What is 12371 in binary?
11000001010011 (hexadecimal 3053, octal 30123).
What is the square root of 12371?
About 111.2250.
Is 12371 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 12371?
12371 is a semiprime: 89 × 139, the product of two primes.