The number 10371
10371 is a composite number with 4 divisors. Its prime factorisation is 3 × 3457. Divisors (4): 1, 3, 3457, 10371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10371: a semiprime: 3 × 3457, the product of two primes.
- 2
10371 is composite. Its prime factorisation is
- 3
The divisors add up to 13832; without 10371 itself that is 3461, so 10371 is deficient (3461 is less than 10371). Euler's totient φ(10371) = 6912 numbers up to 10371 share no factor with it.
- 4
The digits of 10371 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 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10371 = 3 \times 3457 \]
10371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 13832 |
| Euler totient φ(n) | 6912 |
| Square | 107557641 |
| Cube | 1115480294811 |
| Square root | 101.838107 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.0371 × |
10371 in other forms
| Form | Value |
|---|---|
| In words | ten thousand three hundred and seventy-one |
| Binary (base 2) | 10100010000011 |
| Octal (base 8) | 24203 |
| Hexadecimal (base 16) | 2883 |
| Base 3 | 112020010 |
| As time | 10371 seconds = 2 h 52 min 51 s |
Is 10371 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 (10371 ÷ 3 = 3457) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | 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 9) | 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 10371 a prime number?
No. 10371 = 3 × 3457, so it is divisible by 3.
What are the factors of 10371?
1, 3, 3457, 10371.
What is 10371 in binary?
10100010000011 (hexadecimal 2883, octal 24203).
What is the square root of 10371?
About 101.8381.
Is 10371 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 10371?
10371 is a semiprime: 3 × 3457, the product of two primes.