The number 49113
49113 is a composite number with 16 divisors. Its prime factorisation is × 17 × 107. Divisors (16): 1, 3, 9, 17, 27, 51, 107, 153, 321, 459, 963, 1819, 2889, 5457, 16371, 49113.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49113 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49113 is composite. Its prime factorisation is
- 3
The divisors add up to 77760; without 49113 itself that is 28647, so 49113 is deficient (28647 is less than 49113). Euler's totient φ(49113) = 30528 numbers up to 49113 share no factor with it.
- 4
The digits of 49113 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49113 = 3^{3} \times 17 \times 107 \]49113 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 77760 |
| Euler totient φ(n) | 30528 |
| Square | 2412086769 |
| Cube | 118464817485897 |
| Square root | 221.614530 (= 3√5457) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.9113 × |
49113 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and thirteen |
| Binary (base 2) | 1011111111011001 |
| Octal (base 8) | 137731 |
| Hexadecimal (base 16) | BFD9 |
| Base 3 | 2111101000 |
| As time | 49113 seconds = 13 h 38 min 33 s |
Is 49113 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 (49113 ÷ 3 = 16371) | 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 3) | 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 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49113 ÷ 9 = 5457) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49113 a prime number?
No. 49113 = × 17 × 107, so it is divisible by 3.
What are the factors of 49113?
1, 3, 9, 17, 27, 51, 107, 153, 321, 459, 963, 1819, 2889, 5457, 16371, 49113.
What is 49113 in binary?
1011111111011001 (hexadecimal BFD9, octal 137731).
What is the square root of 49113?
About 221.6145, exactly 3√5457.
Is 49113 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 49113?
It is a composite number with 16 divisors.