The number 47751
47751 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 1447. Divisors (8): 1, 3, 11, 33, 1447, 4341, 15917, 47751.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47751 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47751 is composite. Its prime factorisation is
- 3
The divisors add up to 69504; without 47751 itself that is 21753, so 47751 is deficient (21753 is less than 47751). Euler's totient φ(47751) = 28920 numbers up to 47751 share no factor with it.
- 4
The digits of 47751 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47751 = 3 \times 11 \times 1447 \]
47751 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 69504 |
| Euler totient φ(n) | 28920 |
| Square | 2280158001 |
| Cube | 108879824705751 |
| Square root | 218.520022 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.7751 × |
47751 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand seven hundred and fifty-one |
| Binary (base 2) | 1011101010000111 |
| Octal (base 8) | 135207 |
| Hexadecimal (base 16) | BA87 |
| Base 3 | 2102111120 |
| As time | 47751 seconds = 13 h 15 min 51 s |
Is 47751 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 (47751 ÷ 3 = 15917) | 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 4) | 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 | No (remainder 6) | 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 (47751 ÷ 11 = 4341) | 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 47751 a prime number?
No. 47751 = 3 × 11 × 1447, so it is divisible by 3.
What are the factors of 47751?
1, 3, 11, 33, 1447, 4341, 15917, 47751.
What is 47751 in binary?
1011101010000111 (hexadecimal BA87, octal 135207).
What is the square root of 47751?
About 218.5200.
Is 47751 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 47751?
It is a composite number with 8 divisors.