The number 49373
49373 is a composite number with 4 divisors. Its prime factorisation is 97 × 509. Divisors (4): 1, 97, 509, 49373.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49373: a semiprime: 97 × 509, the product of two primes.
- 2
49373 is composite. Its prime factorisation is
- 3
The divisors add up to 49980; without 49373 itself that is 607, so 49373 is deficient (607 is less than 49373). Euler's totient φ(49373) = 48768 numbers up to 49373 share no factor with it.
- 4
The digits of 49373 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 264 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49373 = 97 \times 509 \]
49373 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 49980 |
| Euler totient φ(n) | 48768 |
| Square | 2437693129 |
| Cube | 120356222858117 |
| Square root | 222.200360 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 264 |
| Scientific notation | 4.9373 × |
49373 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and seventy-three |
| Binary (base 2) | 1100000011011101 |
| Octal (base 8) | 140335 |
| Hexadecimal (base 16) | C0DD |
| Base 3 | 2111201122 |
| As time | 49373 seconds = 13 h 42 min 53 s |
Is 49373 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 2) | 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 8) | 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 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 49373 a prime number?
No. 49373 = 97 × 509, so it is divisible by 97.
What are the factors of 49373?
1, 97, 509, 49373.
What is 49373 in binary?
1100000011011101 (hexadecimal C0DD, octal 140335).
What is the square root of 49373?
About 222.2004.
Is 49373 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 49373?
49373 is a semiprime: 97 × 509, the product of two primes.