The number 50158
50158 is a composite number with 8 divisors. Its prime factorisation is 2 × 31 × 809. Divisors (8): 1, 2, 31, 62, 809, 1618, 25079, 50158.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50158 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50158 is composite. Its prime factorisation is
- 3
The divisors add up to 77760; without 50158 itself that is 27602, so 50158 is deficient (27602 is less than 50158). Euler's totient φ(50158) = 24240 numbers up to 50158 share no factor with it.
- 4
The digits of 50158 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50158 = 2 \times 31 \times 809 \]
50158 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 77760 |
| Euler totient φ(n) | 24240 |
| Square | 2515824964 |
| Cube | 126188748544312 |
| Square root | 223.959818 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.0158 × |
50158 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and fifty-eight |
| Binary (base 2) | 1100001111101110 |
| Octal (base 8) | 141756 |
| Hexadecimal (base 16) | C3EE |
| Base 3 | 2112210201 |
| As time | 50158 seconds = 13 h 55 min 58 s |
Is 50158 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50158 ÷ 2 = 25079) | 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 3) | 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 9) | 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 50158 a prime number?
No. 50158 = 2 × 31 × 809, so it is divisible by 2.
What are the factors of 50158?
1, 2, 31, 62, 809, 1618, 25079, 50158.
What is 50158 in binary?
1100001111101110 (hexadecimal C3EE, octal 141756).
What is the square root of 50158?
About 223.9598.
Is 50158 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 50158?
It is a composite number with 8 divisors.