The number 49671
49671 is a composite number with 6 divisors. Its prime factorisation is × 5519. Divisors (6): 1, 3, 9, 5519, 16557, 49671.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49671 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49671 is composite. Its prime factorisation is
- 3
The divisors add up to 71760; without 49671 itself that is 22089, so 49671 is deficient (22089 is less than 49671). Euler's totient φ(49671) = 33108 numbers up to 49671 share no factor with it.
- 4
The digits of 49671 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49671 = 3^{2} \times 5519 \]49671 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 71760 |
| Euler totient φ(n) | 33108 |
| Square | 2467208241 |
| Cube | 122548700538711 |
| Square root | 222.869917 (= 3√5519) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9671 × |
49671 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and seventy-one |
| Binary (base 2) | 1100001000000111 |
| Octal (base 8) | 141007 |
| Hexadecimal (base 16) | C207 |
| Base 3 | 2112010200 |
| As time | 49671 seconds = 13 h 47 min 51 s |
Is 49671 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 (49671 ÷ 3 = 16557) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49671 ÷ 9 = 5519) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49671 a prime number?
No. 49671 = × 5519, so it is divisible by 3.
What are the factors of 49671?
1, 3, 9, 5519, 16557, 49671.
What is 49671 in binary?
1100001000000111 (hexadecimal C207, octal 141007).
What is the square root of 49671?
About 222.8699, exactly 3√5519.
Is 49671 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49671?
It is a composite number with 6 divisors.