The number 50038
50038 is a composite number with 8 divisors. Its prime factorisation is 2 × 127 × 197. Divisors (8): 1, 2, 127, 197, 254, 394, 25019, 50038.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50038 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50038 is composite. Its prime factorisation is
- 3
The divisors add up to 76032; without 50038 itself that is 25994, so 50038 is deficient (25994 is less than 50038). Euler's totient φ(50038) = 24696 numbers up to 50038 share no factor with it.
- 4
The digits of 50038 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50038 = 2 \times 127 \times 197 \]
50038 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 76032 |
| Euler totient φ(n) | 24696 |
| Square | 2503801444 |
| Cube | 125285216654872 |
| Square root | 223.691752 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0038 × |
50038 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and thirty-eight |
| Binary (base 2) | 1100001101110110 |
| Octal (base 8) | 141566 |
| Hexadecimal (base 16) | C376 |
| Base 3 | 2112122021 |
| As time | 50038 seconds = 13 h 53 min 58 s |
Is 50038 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50038 ÷ 2 = 25019) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50038 a prime number?
No. 50038 = 2 × 127 × 197, so it is divisible by 2.
What are the factors of 50038?
1, 2, 127, 197, 254, 394, 25019, 50038.
What is 50038 in binary?
1100001101110110 (hexadecimal C376, octal 141566).
What is the square root of 50038?
About 223.6918.
Is 50038 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50038?
It is a composite number with 8 divisors.