The number 49101
49101 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 1259. Divisors (8): 1, 3, 13, 39, 1259, 3777, 16367, 49101.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49101 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49101 is composite. Its prime factorisation is
- 3
The divisors add up to 70560; without 49101 itself that is 21459, so 49101 is deficient (21459 is less than 49101). Euler's totient φ(49101) = 30192 numbers up to 49101 share no factor with it.
- 4
The digits of 49101 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49101 = 3 \times 13 \times 1259 \]
49101 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 70560 |
| Euler totient φ(n) | 30192 |
| Square | 2410908201 |
| Cube | 118378003577301 |
| Square root | 221.587455 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.9101 × |
49101 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and one |
| Binary (base 2) | 1011111111001101 |
| Octal (base 8) | 137715 |
| Hexadecimal (base 16) | BFCD |
| Base 3 | 2111100120 |
| As time | 49101 seconds = 13 h 38 min 21 s |
Is 49101 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 (49101 ÷ 3 = 16367) | 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 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 3) | 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 | 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 8) | 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 49101 a prime number?
No. 49101 = 3 × 13 × 1259, so it is divisible by 3.
What are the factors of 49101?
1, 3, 13, 39, 1259, 3777, 16367, 49101.
What is 49101 in binary?
1011111111001101 (hexadecimal BFCD, octal 137715).
What is the square root of 49101?
About 221.5875.
Is 49101 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 49101?
It is a composite number with 8 divisors.