The number 49149
49149 is a binary palindrome (1011111111111101). Its prime factorisation is × 43 × 127. Divisors (12): 1, 3, 9, 43, 127, 129, 381, 387, 1143, 5461, 16383, 49149.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49149: a binary palindrome (1011111111111101).
- 2
49149 is composite. Its prime factorisation is
- 3
The divisors add up to 73216; without 49149 itself that is 24067, so 49149 is deficient (24067 is less than 49149). Euler's totient φ(49149) = 31752 numbers up to 49149 share no factor with it.
- 4
The digits of 49149 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49149 = 3^{2} \times 43 \times 127 \]49149 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 73216 |
| Euler totient φ(n) | 31752 |
| Square | 2415624201 |
| Cube | 118725513854949 |
| Square root | 221.695737 (= 3√5461) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9149 × |
49149 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and forty-nine |
| Binary (base 2) | 1011111111111101 |
| Octal (base 8) | 137775 |
| Hexadecimal (base 16) | BFFD |
| Base 3 | 2111102100 |
| As time | 49149 seconds = 13 h 39 min 9 s |
Is 49149 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 (49149 ÷ 3 = 16383) | 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 4) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49149 ÷ 9 = 5461) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 49149 a prime number?
No. 49149 = × 43 × 127, so it is divisible by 3.
What are the factors of 49149?
1, 3, 9, 43, 127, 129, 381, 387, 1143, 5461, 16383, 49149.
What is 49149 in binary?
1011111111111101 (hexadecimal BFFD, octal 137775).
What is the square root of 49149?
About 221.6957, exactly 3√5461.
Is 49149 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49149?
49149 is a binary palindrome (1011111111111101).