The number 50258
50258 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 1933. Divisors (8): 1, 2, 13, 26, 1933, 3866, 25129, 50258.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50258 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50258 is composite. Its prime factorisation is
- 3
The divisors add up to 81228; without 50258 itself that is 30970, so 50258 is deficient (30970 is less than 50258). Euler's totient φ(50258) = 23184 numbers up to 50258 share no factor with it.
- 4
The digits of 50258 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 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50258 = 2 \times 13 \times 1933 \]
50258 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 81228 |
| Euler totient φ(n) | 23184 |
| Square | 2525866564 |
| Cube | 126945001773512 |
| Square root | 224.182961 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.0258 × |
50258 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and fifty-eight |
| Binary (base 2) | 1100010001010010 |
| Octal (base 8) | 142122 |
| Hexadecimal (base 16) | C452 |
| Base 3 | 2112221102 |
| As time | 50258 seconds = 13 h 57 min 38 s |
Is 50258 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50258 ÷ 2 = 25129) | 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 | No (remainder 5) | 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 2) | 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 10) | 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 50258 a prime number?
No. 50258 = 2 × 13 × 1933, so it is divisible by 2.
What are the factors of 50258?
1, 2, 13, 26, 1933, 3866, 25129, 50258.
What is 50258 in binary?
1100010001010010 (hexadecimal C452, octal 142122).
What is the square root of 50258?
About 224.1830.
Is 50258 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50258?
It is a composite number with 8 divisors.