The number 49166
49166 is a composite number with 16 divisors. Its prime factorisation is 2 × 13 × 31 × 61. Divisors (16): 1, 2, 13, 26, 31, 61, 62, 122, 403, 793, 806, 1586, 1891, 3782, 24583, 49166.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49166: a Harshad number: divisible by its digit sum 26.
- 2
49166 is composite. Its prime factorisation is
- 3
The divisors add up to 83328; without 49166 itself that is 34162, so 49166 is deficient (34162 is less than 49166). Euler's totient φ(49166) = 21600 numbers up to 49166 share no factor with it.
- 4
The digits of 49166 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49166 = 2 \times 13 \times 31 \times 61 \]
49166 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 83328 |
| Euler totient φ(n) | 21600 |
| Square | 2417295556 |
| Cube | 118848753306296 |
| Square root | 221.734075 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.9166 × |
49166 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and sixty-six |
| Binary (base 2) | 1100000000001110 |
| Octal (base 8) | 140016 |
| Hexadecimal (base 16) | C00E |
| Base 3 | 2111102222 |
| As time | 49166 seconds = 13 h 39 min 26 s |
Is 49166 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49166 ÷ 2 = 24583) | 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 2) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 6) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49166 a prime number?
No. 49166 = 2 × 13 × 31 × 61, so it is divisible by 2.
What are the factors of 49166?
1, 2, 13, 26, 31, 61, 62, 122, 403, 793, 806, 1586, 1891, 3782, 24583, 49166.
What is 49166 in binary?
1100000000001110 (hexadecimal C00E, octal 140016).
What is the square root of 49166?
About 221.7341.
Is 49166 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 49166?
49166 is a Harshad number: divisible by its digit sum 26.