The number 49046
49046 is a composite number with 8 divisors. Its prime factorisation is 2 × 137 × 179. Divisors (8): 1, 2, 137, 179, 274, 358, 24523, 49046.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49046 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49046 is composite. Its prime factorisation is
- 3
The divisors add up to 74520; without 49046 itself that is 25474, so 49046 is deficient (25474 is less than 49046). Euler's totient φ(49046) = 24208 numbers up to 49046 share no factor with it.
- 4
The digits of 49046 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
\[ 49046 = 2 \times 137 \times 179 \]
49046 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 74520 |
| Euler totient φ(n) | 24208 |
| Square | 2405510116 |
| Cube | 117980649149336 |
| Square root | 221.463315 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.9046 × |
49046 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and forty-six |
| Binary (base 2) | 1011111110010110 |
| Octal (base 8) | 137626 |
| Hexadecimal (base 16) | BF96 |
| Base 3 | 2111021112 |
| As time | 49046 seconds = 13 h 37 min 26 s |
Is 49046 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49046 ÷ 2 = 24523) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49046 a prime number?
No. 49046 = 2 × 137 × 179, so it is divisible by 2.
What are the factors of 49046?
1, 2, 137, 179, 274, 358, 24523, 49046.
What is 49046 in binary?
1011111110010110 (hexadecimal BF96, octal 137626).
What is the square root of 49046?
About 221.4633.
Is 49046 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49046?
It is a composite number with 8 divisors.