The number 4971
4971 is a composite number with 4 divisors. Its prime factorisation is 3 × 1657. Divisors (4): 1, 3, 1657, 4971.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4971: a semiprime: 3 × 1657, the product of two primes.
- 2
4971 is composite. Its prime factorisation is
- 3
The divisors add up to 6632; without 4971 itself that is 1661, so 4971 is deficient (1661 is less than 4971). Euler's totient φ(4971) = 3312 numbers up to 4971 share no factor with it.
- 4
The digits of 4971 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 72 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4971 = 3 \times 1657 \]
4971 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6632 |
| Euler totient φ(n) | 3312 |
| Square | 24710841 |
| Cube | 122837590611 |
| Square root | 70.505319 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 72 |
| Scientific notation | 4.971 × |
4971 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and seventy-one |
| Binary (base 2) | 1001101101011 |
| Octal (base 8) | 11553 |
| Hexadecimal (base 16) | 136B |
| Base 3 | 20211010 |
| As time | 4971 seconds = 1 h 22 min 51 s |
Is 4971 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 (4971 ÷ 3 = 1657) | 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 1) | 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 10) | 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 4971 a prime number?
No. 4971 = 3 × 1657, so it is divisible by 3.
What are the factors of 4971?
1, 3, 1657, 4971.
What is 4971 in binary?
1001101101011 (hexadecimal 136B, octal 11553).
What is the square root of 4971?
About 70.5053.
Is 4971 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 4971?
4971 is a semiprime: 3 × 1657, the product of two primes.