The number 49471
49471 is a composite number with 4 divisors. Its prime factorisation is 61 × 811. Divisors (4): 1, 61, 811, 49471.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49471: a semiprime: 61 × 811, the product of two primes.
- 2
49471 is composite. Its prime factorisation is
- 3
The divisors add up to 50344; without 49471 itself that is 873, so 49471 is deficient (873 is less than 49471). Euler's totient φ(49471) = 48600 numbers up to 49471 share no factor with it.
- 4
The digits of 49471 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49471 = 61 \times 811 \]
49471 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50344 |
| Euler totient φ(n) | 48600 |
| Square | 2447379841 |
| Cube | 121074328114111 |
| Square root | 222.420772 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.9471 × |
49471 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and seventy-one |
| Binary (base 2) | 1100000100111111 |
| Octal (base 8) | 140477 |
| Hexadecimal (base 16) | C13F |
| Base 3 | 2111212021 |
| As time | 49471 seconds = 13 h 44 min 31 s |
Is 49471 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 2) | 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 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 4) | 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 49471 a prime number?
No. 49471 = 61 × 811, so it is divisible by 61.
What are the factors of 49471?
1, 61, 811, 49471.
What is 49471 in binary?
1100000100111111 (hexadecimal C13F, octal 140477).
What is the square root of 49471?
About 222.4208.
Is 49471 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49471?
49471 is a semiprime: 61 × 811, the product of two primes.