The number 5371
5371 is a composite number with 4 divisors. Its prime factorisation is 41 × 131. Divisors (4): 1, 41, 131, 5371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5371: a semiprime: 41 × 131, the product of two primes.
- 2
5371 is composite. Its prime factorisation is
- 3
The divisors add up to 5544; without 5371 itself that is 173, so 5371 is deficient (173 is less than 5371). Euler's totient φ(5371) = 5200 numbers up to 5371 share no factor with it.
- 4
The digits of 5371 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 129 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5371 = 41 \times 131 \]
5371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5544 |
| Euler totient φ(n) | 5200 |
| Square | 28847641 |
| Cube | 154940679811 |
| Square root | 73.287107 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 129 |
| Scientific notation | 5.371 × |
5371 in other forms
| Form | Value |
|---|---|
| In words | five thousand three hundred and seventy-one |
| Binary (base 2) | 1010011111011 |
| Octal (base 8) | 12373 |
| Hexadecimal (base 16) | 14FB |
| Base 3 | 21100221 |
| As time | 5371 seconds = 1 h 29 min 31 s |
Is 5371 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 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 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 3) | 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 5371 a prime number?
No. 5371 = 41 × 131, so it is divisible by 41.
What are the factors of 5371?
1, 41, 131, 5371.
What is 5371 in binary?
1010011111011 (hexadecimal 14FB, octal 12373).
What is the square root of 5371?
About 73.2871.
Is 5371 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 5371?
5371 is a semiprime: 41 × 131, the product of two primes.