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