The number 49073
49073 is a composite number with 4 divisors. Its prime factorisation is 31 × 1583. Divisors (4): 1, 31, 1583, 49073.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49073: a semiprime: 31 × 1583, the product of two primes.
- 2
49073 is composite. Its prime factorisation is
- 3
The divisors add up to 50688; without 49073 itself that is 1615, so 49073 is deficient (1615 is less than 49073). Euler's totient φ(49073) = 47460 numbers up to 49073 share no factor with it.
- 4
The digits of 49073 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49073 = 31 \times 1583 \]
49073 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50688 |
| Euler totient φ(n) | 47460 |
| Square | 2408159329 |
| Cube | 118175602752017 |
| Square root | 221.524265 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.9073 × |
49073 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and seventy-three |
| Binary (base 2) | 1011111110110001 |
| Octal (base 8) | 137661 |
| Hexadecimal (base 16) | BFB1 |
| Base 3 | 2111022112 |
| As time | 49073 seconds = 13 h 37 min 53 s |
Is 49073 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 3) | 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 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 49073 a prime number?
No. 49073 = 31 × 1583, so it is divisible by 31.
What are the factors of 49073?
1, 31, 1583, 49073.
What is 49073 in binary?
1011111110110001 (hexadecimal BFB1, octal 137661).
What is the square root of 49073?
About 221.5243.
Is 49073 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49073?
49073 is a semiprime: 31 × 1583, the product of two primes.