The number 49011
49011 is a composite number with 12 divisors. Its prime factorisation is 3 × 17 × . Divisors (12): 1, 3, 17, 31, 51, 93, 527, 961, 1581, 2883, 16337, 49011.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49011 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49011 is composite. Its prime factorisation is
- 3
The divisors add up to 71496; without 49011 itself that is 22485, so 49011 is deficient (22485 is less than 49011). Euler's totient φ(49011) = 29760 numbers up to 49011 share no factor with it.
- 4
The digits of 49011 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49011 = 3 \times 17 \times 31^{2} \]49011 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 71496 |
| Euler totient φ(n) | 29760 |
| Square | 2402078121 |
| Cube | 117728250788331 |
| Square root | 221.384281 (= 31√51) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9011 × |
49011 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and eleven |
| Binary (base 2) | 1011111101110011 |
| Octal (base 8) | 137563 |
| Hexadecimal (base 16) | BF73 |
| Base 3 | 2111020020 |
| As time | 49011 seconds = 13 h 36 min 51 s |
Is 49011 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 (49011 ÷ 3 = 16337) | 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 4) | 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 | No (remainder 6) | 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 6) | 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 49011 a prime number?
No. 49011 = 3 × 17 × , so it is divisible by 3.
What are the factors of 49011?
1, 3, 17, 31, 51, 93, 527, 961, 1581, 2883, 16337, 49011.
What is 49011 in binary?
1011111101110011 (hexadecimal BF73, octal 137563).
What is the square root of 49011?
About 221.3843, exactly 31√51.
Is 49011 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 49011?
It is a composite number with 12 divisors.