The number 49161
49161 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 2341. Divisors (8): 1, 3, 7, 21, 2341, 7023, 16387, 49161.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49161: a Harshad number: divisible by its digit sum 21.
- 2
49161 is composite. Its prime factorisation is
- 3
The divisors add up to 74944; without 49161 itself that is 25783, so 49161 is deficient (25783 is less than 49161). Euler's totient φ(49161) = 28080 numbers up to 49161 share no factor with it.
- 4
The digits of 49161 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49161 = 3 \times 7 \times 2341 \]
49161 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 74944 |
| Euler totient φ(n) | 28080 |
| Square | 2416803921 |
| Cube | 118812497560281 |
| Square root | 221.722800 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9161 × |
49161 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and sixty-one |
| Binary (base 2) | 1100000000001001 |
| Octal (base 8) | 140011 |
| Hexadecimal (base 16) | C009 |
| Base 3 | 2111102210 |
| As time | 49161 seconds = 13 h 39 min 21 s |
Is 49161 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 (49161 ÷ 3 = 16387) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49161 ÷ 7 = 7023) | 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 3) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49161 a prime number?
No. 49161 = 3 × 7 × 2341, so it is divisible by 3.
What are the factors of 49161?
1, 3, 7, 21, 2341, 7023, 16387, 49161.
What is 49161 in binary?
1100000000001001 (hexadecimal C009, octal 140011).
What is the square root of 49161?
About 221.7228.
Is 49161 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 49161?
49161 is a Harshad number: divisible by its digit sum 21.