The number 47851
47851 is a composite number with 4 divisors. Its prime factorisation is 109 × 439. Divisors (4): 1, 109, 439, 47851.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47851: a semiprime: 109 × 439, the product of two primes.
- 2
47851 is composite. Its prime factorisation is
- 3
The divisors add up to 48400; without 47851 itself that is 549, so 47851 is deficient (549 is less than 47851). Euler's totient φ(47851) = 47304 numbers up to 47851 share no factor with it.
- 4
The digits of 47851 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47851 = 109 \times 439 \]
47851 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 48400 |
| Euler totient φ(n) | 47304 |
| Square | 2289718201 |
| Cube | 109565305636051 |
| Square root | 218.748714 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.7851 × |
47851 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand eight hundred and fifty-one |
| Binary (base 2) | 1011101011101011 |
| Octal (base 8) | 135353 |
| Hexadecimal (base 16) | BAEB |
| Base 3 | 2102122021 |
| As time | 47851 seconds = 13 h 17 min 31 s |
Is 47851 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 6) | 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 1) | 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 47851 a prime number?
No. 47851 = 109 × 439, so it is divisible by 109.
What are the factors of 47851?
1, 109, 439, 47851.
What is 47851 in binary?
1011101011101011 (hexadecimal BAEB, octal 135353).
What is the square root of 47851?
About 218.7487.
Is 47851 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 47851?
47851 is a semiprime: 109 × 439, the product of two primes.