The number 49146
49146 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 8191. Divisors (8): 1, 2, 3, 6, 8191, 16382, 24573, 49146.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49146 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49146 is composite. Its prime factorisation is
- 3
The divisors add up to 98304; without 49146 itself that is 49158, so 49146 is abundant (49158 is more than 49146). Euler's totient φ(49146) = 16380 numbers up to 49146 share no factor with it.
- 4
The digits of 49146 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49146 = 2 \times 3 \times 8191 \]
49146 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 98304 |
| Euler totient φ(n) | 16380 |
| Square | 2415329316 |
| Cube | 118703774564136 |
| Square root | 221.688971 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9146 × |
49146 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and forty-six |
| Binary (base 2) | 1011111111111010 |
| Octal (base 8) | 137772 |
| Hexadecimal (base 16) | BFFA |
| Base 3 | 2111102020 |
| As time | 49146 seconds = 13 h 39 min 6 s |
Is 49146 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49146 ÷ 2 = 24573) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49146 ÷ 3 = 16382) | 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 | Yes (49146 ÷ 6 = 8191) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49146 a prime number?
No. 49146 = 2 × 3 × 8191, so it is divisible by 2.
What are the factors of 49146?
1, 2, 3, 6, 8191, 16382, 24573, 49146.
What is 49146 in binary?
1011111111111010 (hexadecimal BFFA, octal 137772).
What is the square root of 49146?
About 221.6890.
Is 49146 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49146?
It is a composite number with 8 divisors.