The number 49394
49394 is a palindrome: it reads 49394 backwards too. Its prime factorisation is 2 × 24697. Divisors (4): 1, 2, 24697, 49394.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49394: a palindrome: it reads 49394 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 24697, the product of two primes.
- 2
49394 is composite. Its prime factorisation is
- 3
The divisors add up to 74094; without 49394 itself that is 24700, so 49394 is deficient (24700 is less than 49394). Euler's totient φ(49394) = 24696 numbers up to 49394 share no factor with it.
- 4
The digits of 49394 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49394 = 2 \times 24697 \]
49394 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 74094 |
| Euler totient φ(n) | 24696 |
| Square | 2439767236 |
| Cube | 120509862854984 |
| Square root | 222.247610 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.9394 × |
49394 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and ninety-four |
| Binary (base 2) | 1100000011110010 |
| Octal (base 8) | 140362 |
| Hexadecimal (base 16) | C0F2 |
| Base 3 | 2111202102 |
| As time | 49394 seconds = 13 h 43 min 14 s |
Is 49394 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49394 ÷ 2 = 24697) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 2) | 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 4) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49394 a prime number?
No. 49394 = 2 × 24697, so it is divisible by 2.
What are the factors of 49394?
1, 2, 24697, 49394.
What is 49394 in binary?
1100000011110010 (hexadecimal C0F2, octal 140362).
What is the square root of 49394?
About 222.2476.
Is 49394 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 49394?
49394 is a palindrome: it reads 49394 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 24697, the product of two primes.