The number 5971
5971 is a composite number with 4 divisors. Its prime factorisation is 7 × 853. Divisors (4): 1, 7, 853, 5971.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5971: a semiprime: 7 × 853, the product of two primes.
- 2
5971 is composite. Its prime factorisation is
- 3
The divisors add up to 6832; without 5971 itself that is 861, so 5971 is deficient (861 is less than 5971). Euler's totient φ(5971) = 5112 numbers up to 5971 share no factor with it.
- 4
The digits of 5971 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 142 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5971 = 7 \times 853 \]
5971 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6832 |
| Euler totient φ(n) | 5112 |
| Square | 35652841 |
| Cube | 212883113611 |
| Square root | 77.272246 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 142 |
| Scientific notation | 5.971 × |
5971 in other forms
| Form | Value |
|---|---|
| In words | five thousand nine hundred and seventy-one |
| Binary (base 2) | 1011101010011 |
| Octal (base 8) | 13523 |
| Hexadecimal (base 16) | 1753 |
| Base 3 | 22012011 |
| As time | 5971 seconds = 1 h 39 min 31 s |
Is 5971 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 (5971 ÷ 7 = 853) | 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 9) | 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 5971 a prime number?
No. 5971 = 7 × 853, so it is divisible by 7.
What are the factors of 5971?
1, 7, 853, 5971.
What is 5971 in binary?
1011101010011 (hexadecimal 1753, octal 13523).
What is the square root of 5971?
About 77.2722.
Is 5971 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 5971?
5971 is a semiprime: 7 × 853, the product of two primes.