The number 47971
47971 is a composite number with 12 divisors. Its prime factorisation is × 11 × 89. Divisors (12): 1, 7, 11, 49, 77, 89, 539, 623, 979, 4361, 6853, 47971.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47971 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47971 is composite. Its prime factorisation is
- 3
The divisors add up to 61560; without 47971 itself that is 13589, so 47971 is deficient (13589 is less than 47971). Euler's totient φ(47971) = 36960 numbers up to 47971 share no factor with it.
- 4
The digits of 47971 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47971 = 7^{2} \times 11 \times 89 \]47971 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 61560 |
| Euler totient φ(n) | 36960 |
| Square | 2301216841 |
| Cube | 110391673079611 |
| Square root | 219.022830 (= 7√979) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.7971 × |
47971 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and seventy-one |
| Binary (base 2) | 1011101101100011 |
| Octal (base 8) | 135543 |
| Hexadecimal (base 16) | BB63 |
| Base 3 | 2102210201 |
| As time | 47971 seconds = 13 h 19 min 31 s |
Is 47971 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 (47971 ÷ 7 = 6853) | 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 1) | 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 | Yes (47971 ÷ 11 = 4361) | 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 47971 a prime number?
No. 47971 = × 11 × 89, so it is divisible by 7.
What are the factors of 47971?
1, 7, 11, 49, 77, 89, 539, 623, 979, 4361, 6853, 47971.
What is 47971 in binary?
1011101101100011 (hexadecimal BB63, octal 135543).
What is the square root of 47971?
About 219.0228, exactly 7√979.
Is 47971 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 47971?
It is a composite number with 12 divisors.