The number 49268
49268 is a composite number with 12 divisors. Its prime factorisation is × 109 × 113. Divisors (12): 1, 2, 4, 109, 113, 218, 226, 436, 452, 12317, 24634, 49268.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49268 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49268 is composite. Its prime factorisation is
- 3
The divisors add up to 87780; without 49268 itself that is 38512, so 49268 is deficient (38512 is less than 49268). Euler's totient φ(49268) = 24192 numbers up to 49268 share no factor with it.
- 4
The digits of 49268 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49268 = 2^{2} \times 109 \times 113 \]49268 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 87780 |
| Euler totient φ(n) | 24192 |
| Square | 2427335824 |
| Cube | 119589981376832 |
| Square root | 221.963961 (= 2√12317) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9268 × |
49268 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and sixty-eight |
| Binary (base 2) | 1100000001110100 |
| Octal (base 8) | 140164 |
| Hexadecimal (base 16) | C074 |
| Base 3 | 2111120202 |
| As time | 49268 seconds = 13 h 41 min 8 s |
Is 49268 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49268 ÷ 2 = 24634) | 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 (49268 ÷ 4 = 12317) | 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 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 4) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 49268 a prime number?
No. 49268 = × 109 × 113, so it is divisible by 2.
What are the factors of 49268?
1, 2, 4, 109, 113, 218, 226, 436, 452, 12317, 24634, 49268.
What is 49268 in binary?
1100000001110100 (hexadecimal C074, octal 140164).
What is the square root of 49268?
About 221.9640, exactly 2√12317.
Is 49268 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 49268?
It is a composite number with 12 divisors.