The number 49438
49438 is a composite number with 8 divisors. Its prime factorisation is 2 × 19 × 1301. Divisors (8): 1, 2, 19, 38, 1301, 2602, 24719, 49438.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49438 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49438 is composite. Its prime factorisation is
- 3
The divisors add up to 78120; without 49438 itself that is 28682, so 49438 is deficient (28682 is less than 49438). Euler's totient φ(49438) = 23400 numbers up to 49438 share no factor with it.
- 4
The digits of 49438 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49438 = 2 \times 19 \times 1301 \]
49438 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 78120 |
| Euler totient φ(n) | 23400 |
| Square | 2444115844 |
| Cube | 120832199095672 |
| Square root | 222.346576 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9438 × |
49438 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and thirty-eight |
| Binary (base 2) | 1100000100011110 |
| Octal (base 8) | 140436 |
| Hexadecimal (base 16) | C11E |
| Base 3 | 2111211001 |
| As time | 49438 seconds = 13 h 43 min 58 s |
Is 49438 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49438 ÷ 2 = 24719) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49438 a prime number?
No. 49438 = 2 × 19 × 1301, so it is divisible by 2.
What are the factors of 49438?
1, 2, 19, 38, 1301, 2602, 24719, 49438.
What is 49438 in binary?
1100000100011110 (hexadecimal C11E, octal 140436).
What is the square root of 49438?
About 222.3466.
Is 49438 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 49438?
It is a composite number with 8 divisors.