The number 47141
47141 is a composite number with 8 divisors. Its prime factorisation is 17 × 47 × 59. Divisors (8): 1, 17, 47, 59, 799, 1003, 2773, 47141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47141: a Harshad number: divisible by its digit sum 17.
- 2
47141 is composite. Its prime factorisation is
- 3
The divisors add up to 51840; without 47141 itself that is 4699, so 47141 is deficient (4699 is less than 47141). Euler's totient φ(47141) = 42688 numbers up to 47141 share no factor with it.
- 4
The digits of 47141 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47141 = 17 \times 47 \times 59 \]
47141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 51840 |
| Euler totient φ(n) | 42688 |
| Square | 2222273881 |
| Cube | 104760213024221 |
| Square root | 217.119783 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.7141 × |
47141 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand one hundred and forty-one |
| Binary (base 2) | 1011100000100101 |
| Octal (base 8) | 134045 |
| Hexadecimal (base 16) | B825 |
| Base 3 | 2101122222 |
| As time | 47141 seconds = 13 h 5 min 41 s |
Is 47141 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47141 a prime number?
No. 47141 = 17 × 47 × 59, so it is divisible by 17.
What are the factors of 47141?
1, 17, 47, 59, 799, 1003, 2773, 47141.
What is 47141 in binary?
1011100000100101 (hexadecimal B825, octal 134045).
What is the square root of 47141?
About 217.1198.
Is 47141 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 47141?
47141 is a Harshad number: divisible by its digit sum 17.