The number 49131
49131 is a composite number with 12 divisors. Its prime factorisation is × 53 × 103. Divisors (12): 1, 3, 9, 53, 103, 159, 309, 477, 927, 5459, 16377, 49131.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49131 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49131 is composite. Its prime factorisation is
- 3
The divisors add up to 73008; without 49131 itself that is 23877, so 49131 is deficient (23877 is less than 49131). Euler's totient φ(49131) = 31824 numbers up to 49131 share no factor with it.
- 4
The digits of 49131 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49131 = 3^{2} \times 53 \times 103 \]49131 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 73008 |
| Euler totient φ(n) | 31824 |
| Square | 2413855161 |
| Cube | 118595117915091 |
| Square root | 221.655138 (= 3√5459) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.9131 × |
49131 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and thirty-one |
| Binary (base 2) | 1011111111101011 |
| Octal (base 8) | 137753 |
| Hexadecimal (base 16) | BFEB |
| Base 3 | 2111101200 |
| As time | 49131 seconds = 13 h 38 min 51 s |
Is 49131 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 (49131 ÷ 3 = 16377) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49131 ÷ 9 = 5459) | 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 5) | 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 49131 a prime number?
No. 49131 = × 53 × 103, so it is divisible by 3.
What are the factors of 49131?
1, 3, 9, 53, 103, 159, 309, 477, 927, 5459, 16377, 49131.
What is 49131 in binary?
1011111111101011 (hexadecimal BFEB, octal 137753).
What is the square root of 49131?
About 221.6551, exactly 3√5459.
Is 49131 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 49131?
It is a composite number with 12 divisors.