The number 47641
47641 is a composite number with 8 divisors. Its prime factorisation is 11 × 61 × 71. Divisors (8): 1, 11, 61, 71, 671, 781, 4331, 47641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47641 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47641 is composite. Its prime factorisation is
- 3
The divisors add up to 53568; without 47641 itself that is 5927, so 47641 is deficient (5927 is less than 47641). Euler's totient φ(47641) = 42000 numbers up to 47641 share no factor with it.
- 4
The digits of 47641 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47641 = 11 \times 61 \times 71 \]
47641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 53568 |
| Euler totient φ(n) | 42000 |
| Square | 2269664881 |
| Cube | 108129104595721 |
| Square root | 218.268184 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.7641 × |
47641 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand six hundred and forty-one |
| Binary (base 2) | 1011101000011001 |
| Octal (base 8) | 135031 |
| Hexadecimal (base 16) | BA19 |
| Base 3 | 2102100111 |
| As time | 47641 seconds = 13 h 14 min 1 s |
Is 47641 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 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 (47641 ÷ 11 = 4331) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47641 a prime number?
No. 47641 = 11 × 61 × 71, so it is divisible by 11.
What are the factors of 47641?
1, 11, 61, 71, 671, 781, 4331, 47641.
What is 47641 in binary?
1011101000011001 (hexadecimal BA19, octal 135031).
What is the square root of 47641?
About 218.2682.
Is 47641 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 47641?
It is a composite number with 8 divisors.