The number 49097
49097 is a composite number with 4 divisors. Its prime factorisation is 29 × 1693. Divisors (4): 1, 29, 1693, 49097.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49097: a Harshad number: divisible by its digit sum 29; a semiprime: 29 × 1693, the product of two primes.
- 2
49097 is composite. Its prime factorisation is
- 3
The divisors add up to 50820; without 49097 itself that is 1723, so 49097 is deficient (1723 is less than 49097). Euler's totient φ(49097) = 47376 numbers up to 49097 share no factor with it.
- 4
The digits of 49097 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49097 = 29 \times 1693 \]
49097 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50820 |
| Euler totient φ(n) | 47376 |
| Square | 2410515409 |
| Cube | 118349075035673 |
| Square root | 221.578429 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.9097 × |
49097 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and ninety-seven |
| Binary (base 2) | 1011111111001001 |
| Octal (base 8) | 137711 |
| Hexadecimal (base 16) | BFC9 |
| Base 3 | 2111100102 |
| As time | 49097 seconds = 13 h 38 min 17 s |
Is 49097 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 2) | 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 6) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 49097 a prime number?
No. 49097 = 29 × 1693, so it is divisible by 29.
What are the factors of 49097?
1, 29, 1693, 49097.
What is 49097 in binary?
1011111111001001 (hexadecimal BFC9, octal 137711).
What is the square root of 49097?
About 221.5784.
Is 49097 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 49097?
49097 is a Harshad number: divisible by its digit sum 29; a semiprime: 29 × 1693, the product of two primes.