The number 49468
49468 is a composite number with 12 divisors. Its prime factorisation is × 83 × 149. Divisors (12): 1, 2, 4, 83, 149, 166, 298, 332, 596, 12367, 24734, 49468.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49468 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49468 is composite. Its prime factorisation is
- 3
The divisors add up to 88200; without 49468 itself that is 38732, so 49468 is deficient (38732 is less than 49468). Euler's totient φ(49468) = 24272 numbers up to 49468 share no factor with it.
- 4
The digits of 49468 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49468 = 2^{2} \times 83 \times 149 \]49468 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 88200 |
| Euler totient φ(n) | 24272 |
| Square | 2447083024 |
| Cube | 121052303031232 |
| Square root | 222.414028 (= 2√12367) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9468 × |
49468 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and sixty-eight |
| Binary (base 2) | 1100000100111100 |
| Octal (base 8) | 140474 |
| Hexadecimal (base 16) | C13C |
| Base 3 | 2111212011 |
| As time | 49468 seconds = 13 h 44 min 28 s |
Is 49468 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49468 ÷ 2 = 24734) | 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 | Yes (49468 ÷ 4 = 12367) | 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 6) | 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 4) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49468 a prime number?
No. 49468 = × 83 × 149, so it is divisible by 2.
What are the factors of 49468?
1, 2, 4, 83, 149, 166, 298, 332, 596, 12367, 24734, 49468.
What is 49468 in binary?
1100000100111100 (hexadecimal C13C, octal 140474).
What is the square root of 49468?
About 222.4140, exactly 2√12367.
Is 49468 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 49468?
It is a composite number with 12 divisors.