The number 47050
47050 is a composite number with 12 divisors. Its prime factorisation is 2 × × 941. Divisors (12): 1, 2, 5, 10, 25, 50, 941, 1882, 4705, 9410, 23525, 47050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47050 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47050 is composite. Its prime factorisation is
- 3
The divisors add up to 87606; without 47050 itself that is 40556, so 47050 is deficient (40556 is less than 47050). Euler's totient φ(47050) = 18800 numbers up to 47050 share no factor with it.
- 4
The digits of 47050 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47050 = 2 \times 5^{2} \times 941 \]47050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 87606 |
| Euler totient φ(n) | 18800 |
| Square | 2213702500 |
| Cube | 104154702625000 |
| Square root | 216.910120 (= 5√1882) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.705 × |
47050 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand and fifty |
| Binary (base 2) | 1011011111001010 |
| Octal (base 8) | 133712 |
| Hexadecimal (base 16) | B7CA |
| Base 3 | 2101112121 |
| As time | 47050 seconds = 13 h 4 min 10 s |
Is 47050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47050 ÷ 2 = 23525) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (47050 ÷ 5 = 9410) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 2) | 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 | Yes (47050 ÷ 10 = 4705) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47050 a prime number?
No. 47050 = 2 × × 941, so it is divisible by 2.
What are the factors of 47050?
1, 2, 5, 10, 25, 50, 941, 1882, 4705, 9410, 23525, 47050.
What is 47050 in binary?
1011011111001010 (hexadecimal B7CA, octal 133712).
What is the square root of 47050?
About 216.9101, exactly 5√1882.
Is 47050 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 47050?
It is a composite number with 12 divisors.