The number 49753
49753 is a composite number with 4 divisors. Its prime factorisation is 11 × 4523. Divisors (4): 1, 11, 4523, 49753.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49753: a semiprime: 11 × 4523, the product of two primes.
- 2
49753 is composite. Its prime factorisation is
- 3
The divisors add up to 54288; without 49753 itself that is 4535, so 49753 is deficient (4535 is less than 49753). Euler's totient φ(49753) = 45220 numbers up to 49753 share no factor with it.
- 4
The digits of 49753 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49753 = 11 \times 4523 \]
49753 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 54288 |
| Euler totient φ(n) | 45220 |
| Square | 2475361009 |
| Cube | 123156636280777 |
| Square root | 223.053805 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9753 × |
49753 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand seven hundred and fifty-three |
| Binary (base 2) | 1100001001011001 |
| Octal (base 8) | 141131 |
| Hexadecimal (base 16) | C259 |
| Base 3 | 2112020201 |
| As time | 49753 seconds = 13 h 49 min 13 s |
Is 49753 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 3) | 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49753 ÷ 11 = 4523) | 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 49753 a prime number?
No. 49753 = 11 × 4523, so it is divisible by 11.
What are the factors of 49753?
1, 11, 4523, 49753.
What is 49753 in binary?
1100001001011001 (hexadecimal C259, octal 141131).
What is the square root of 49753?
About 223.0538.
Is 49753 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 49753?
49753 is a semiprime: 11 × 4523, the product of two primes.