The number 11371
11371 is a composite number with 4 divisors. Its prime factorisation is 83 × 137. Divisors (4): 1, 83, 137, 11371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11371: a semiprime: 83 × 137, the product of two primes.
- 2
11371 is composite. Its prime factorisation is
- 3
The divisors add up to 11592; without 11371 itself that is 221, so 11371 is deficient (221 is less than 11371). Euler's totient φ(11371) = 11152 numbers up to 11371 share no factor with it.
- 4
The digits of 11371 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11371 = 83 \times 137 \]
11371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11592 |
| Euler totient φ(n) | 11152 |
| Square | 129299641 |
| Cube | 1470266217811 |
| Square root | 106.634891 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.1371 × |
11371 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand three hundred and seventy-one |
| Binary (base 2) | 10110001101011 |
| Octal (base 8) | 26153 |
| Hexadecimal (base 16) | 2C6B |
| Base 3 | 120121011 |
| As time | 11371 seconds = 3 h 9 min 31 s |
Is 11371 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 | No (remainder 3) | 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 4) | 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 8) | 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 11371 a prime number?
No. 11371 = 83 × 137, so it is divisible by 83.
What are the factors of 11371?
1, 83, 137, 11371.
What is 11371 in binary?
10110001101011 (hexadecimal 2C6B, octal 26153).
What is the square root of 11371?
About 106.6349.
Is 11371 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 11371?
11371 is a semiprime: 83 × 137, the product of two primes.