The number 47871
47871 is a composite number with 12 divisors. Its prime factorisation is × 197. Divisors (12): 1, 3, 9, 27, 81, 197, 243, 591, 1773, 5319, 15957, 47871.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47871: a Harshad number: divisible by its digit sum 27.
- 2
47871 is composite. Its prime factorisation is
- 3
The divisors add up to 72072; without 47871 itself that is 24201, so 47871 is deficient (24201 is less than 47871). Euler's totient φ(47871) = 31752 numbers up to 47871 share no factor with it.
- 4
The digits of 47871 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47871 = 3^{5} \times 197 \]47871 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 72072 |
| Euler totient φ(n) | 31752 |
| Square | 2291632641 |
| Cube | 109702746157311 |
| Square root | 218.794424 (= 9√591) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.7871 × |
47871 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand eight hundred and seventy-one |
| Binary (base 2) | 1011101011111111 |
| Octal (base 8) | 135377 |
| Hexadecimal (base 16) | BAFF |
| Base 3 | 2102200000 |
| As time | 47871 seconds = 13 h 17 min 51 s |
Is 47871 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 (47871 ÷ 3 = 15957) | 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 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (47871 ÷ 9 = 5319) | 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 47871 a prime number?
No. 47871 = × 197, so it is divisible by 3.
What are the factors of 47871?
1, 3, 9, 27, 81, 197, 243, 591, 1773, 5319, 15957, 47871.
What is 47871 in binary?
1011101011111111 (hexadecimal BAFF, octal 135377).
What is the square root of 47871?
About 218.7944, exactly 9√591.
Is 47871 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 47871?
47871 is a Harshad number: divisible by its digit sum 27.