The number 49901
49901 is a composite number with 4 divisors. Its prime factorisation is 139 × 359. Divisors (4): 1, 139, 359, 49901.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49901: a semiprime: 139 × 359, the product of two primes.
- 2
49901 is composite. Its prime factorisation is
- 3
The divisors add up to 50400; without 49901 itself that is 499, so 49901 is deficient (499 is less than 49901). Euler's totient φ(49901) = 49404 numbers up to 49901 share no factor with it.
- 4
The digits of 49901 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49901 = 139 \times 359 \]
49901 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50400 |
| Euler totient φ(n) | 49404 |
| Square | 2490109801 |
| Cube | 124258969179701 |
| Square root | 223.385317 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 202 |
| Scientific notation | 4.9901 × |
49901 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand nine hundred and one |
| Binary (base 2) | 1100001011101101 |
| Octal (base 8) | 141355 |
| Hexadecimal (base 16) | C2ED |
| Base 3 | 2112110012 |
| As time | 49901 seconds = 13 h 51 min 41 s |
Is 49901 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 | No (remainder 2) | 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 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49901 a prime number?
No. 49901 = 139 × 359, so it is divisible by 139.
What are the factors of 49901?
1, 139, 359, 49901.
What is 49901 in binary?
1100001011101101 (hexadecimal C2ED, octal 141355).
What is the square root of 49901?
About 223.3853.
Is 49901 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49901?
49901 is a semiprime: 139 × 359, the product of two primes.