The number 50078
50078 is a composite number with 16 divisors. Its prime factorisation is 2 × × 73. Divisors (16): 1, 2, 7, 14, 49, 73, 98, 146, 343, 511, 686, 1022, 3577, 7154, 25039, 50078.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50078 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50078 is composite. Its prime factorisation is
- 3
The divisors add up to 88800; without 50078 itself that is 38722, so 50078 is deficient (38722 is less than 50078). Euler's totient φ(50078) = 21168 numbers up to 50078 share no factor with it.
- 4
The digits of 50078 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50078 = 2 \times 7^{3} \times 73 \]50078 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 88800 |
| Euler totient φ(n) | 21168 |
| Square | 2507806084 |
| Cube | 125585913074552 |
| Square root | 223.781143 (= 7√1022) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0078 × |
50078 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and seventy-eight |
| Binary (base 2) | 1100001110011110 |
| Octal (base 8) | 141636 |
| Hexadecimal (base 16) | C39E |
| Base 3 | 2112200202 |
| As time | 50078 seconds = 13 h 54 min 38 s |
Is 50078 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50078 ÷ 2 = 25039) | 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 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 | Yes (50078 ÷ 7 = 7154) | 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 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 6) | 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 50078 a prime number?
No. 50078 = 2 × × 73, so it is divisible by 2.
What are the factors of 50078?
1, 2, 7, 14, 49, 73, 98, 146, 343, 511, 686, 1022, 3577, 7154, 25039, 50078.
What is 50078 in binary?
1100001110011110 (hexadecimal C39E, octal 141636).
What is the square root of 50078?
About 223.7811, exactly 7√1022.
Is 50078 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50078?
It is a composite number with 16 divisors.