The number 49208
49208 is a composite number with 8 divisors. Its prime factorisation is × 6151. Divisors (8): 1, 2, 4, 8, 6151, 12302, 24604, 49208.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49208 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49208 is composite. Its prime factorisation is
- 3
The divisors add up to 92280; without 49208 itself that is 43072, so 49208 is deficient (43072 is less than 49208). Euler's totient φ(49208) = 24600 numbers up to 49208 share no factor with it.
- 4
The digits of 49208 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49208 = 2^{3} \times 6151 \]49208 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 92280 |
| Euler totient φ(n) | 24600 |
| Square | 2421427264 |
| Cube | 119153592806912 |
| Square root | 221.828763 (= 2√12302) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.9208 × |
49208 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and eight |
| Binary (base 2) | 1100000000111000 |
| Octal (base 8) | 140070 |
| Hexadecimal (base 16) | C038 |
| Base 3 | 2111111112 |
| As time | 49208 seconds = 13 h 40 min 8 s |
Is 49208 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49208 ÷ 2 = 24604) | 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 | Yes (49208 ÷ 4 = 12302) | 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 2) | 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 | Yes (49208 ÷ 8 = 6151) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49208 a prime number?
No. 49208 = × 6151, so it is divisible by 2.
What are the factors of 49208?
1, 2, 4, 8, 6151, 12302, 24604, 49208.
What is 49208 in binary?
1100000000111000 (hexadecimal C038, octal 140070).
What is the square root of 49208?
About 221.8288, exactly 2√12302.
Is 49208 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49208?
It is a composite number with 8 divisors.