The number 49078
49078 is a composite number with 8 divisors. Its prime factorisation is 2 × 53 × 463. Divisors (8): 1, 2, 53, 106, 463, 926, 24539, 49078.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49078 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49078 is composite. Its prime factorisation is
- 3
The divisors add up to 75168; without 49078 itself that is 26090, so 49078 is deficient (26090 is less than 49078). Euler's totient φ(49078) = 24024 numbers up to 49078 share no factor with it.
- 4
The digits of 49078 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
\[ 49078 = 2 \times 53 \times 463 \]
49078 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75168 |
| Euler totient φ(n) | 24024 |
| Square | 2408650084 |
| Cube | 118211728822552 |
| Square root | 221.535550 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9078 × |
49078 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and seventy-eight |
| Binary (base 2) | 1011111110110110 |
| Octal (base 8) | 137666 |
| Hexadecimal (base 16) | BFB6 |
| Base 3 | 2111022201 |
| As time | 49078 seconds = 13 h 37 min 58 s |
Is 49078 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49078 ÷ 2 = 24539) | 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 1) | 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 7) | 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 49078 a prime number?
No. 49078 = 2 × 53 × 463, so it is divisible by 2.
What are the factors of 49078?
1, 2, 53, 106, 463, 926, 24539, 49078.
What is 49078 in binary?
1011111110110110 (hexadecimal BFB6, octal 137666).
What is the square root of 49078?
About 221.5356.
Is 49078 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 49078?
It is a composite number with 8 divisors.