The number 49439
49439 is a composite number with 4 divisors. Its prime factorisation is 13 × 3803. Divisors (4): 1, 13, 3803, 49439.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49439: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 3803, the product of two primes.
- 2
49439 is composite. Its prime factorisation is
- 3
The divisors add up to 53256; without 49439 itself that is 3817, so 49439 is deficient (3817 is less than 49439). Euler's totient φ(49439) = 45624 numbers up to 49439 share no factor with it.
- 4
The digits of 49439 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 119 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49439 = 13 \times 3803 \]
49439 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53256 |
| Euler totient φ(n) | 45624 |
| Square | 2444214721 |
| Cube | 120839531591519 |
| Square root | 222.348825 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 119 |
| Scientific notation | 4.9439 × |
49439 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and thirty-nine |
| Binary (base 2) | 1100000100011111 |
| Octal (base 8) | 140437 |
| Hexadecimal (base 16) | C11F |
| Base 3 | 2111211002 |
| As time | 49439 seconds = 13 h 43 min 59 s |
Is 49439 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 3) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 7) | 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 9) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49439 a prime number?
No. 49439 = 13 × 3803, so it is divisible by 13.
What are the factors of 49439?
1, 13, 3803, 49439.
What is 49439 in binary?
1100000100011111 (hexadecimal C11F, octal 140437).
What is the square root of 49439?
About 222.3488.
Is 49439 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 49439?
49439 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 3803, the product of two primes.