Base | Representation |
---|---|
bin | 1100001000000… |
… | …0100011111110 |
3 | 10112200212101110 |
4 | 3002000203332 |
5 | 101004430423 |
6 | 5014022450 |
7 | 1155200514 |
oct | 302004376 |
9 | 115625343 |
10 | 50858238 |
11 | 26787602 |
12 | 15047a26 |
13 | a6c8c42 |
14 | 6a7c4b4 |
15 | 46e9193 |
hex | 30808fe |
50858238 has 8 divisors (see below), whose sum is σ = 101716488. Its totient is φ = 16952744.
The previous prime is 50858233. The next prime is 50858243. The reversal of 50858238 is 83285805.
It is an interprime number because it is at equal distance from previous prime (50858233) and next prime (50858243).
It is a sphenic number, since it is the product of 3 distinct primes.
50858238 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 50858196 and 50858205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50858233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4238181 + ... + 4238192.
It is an arithmetic number, because the mean of its divisors is an integer number (12714561).
Almost surely, 250858238 is an apocalyptic number.
50858238 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50858238 is a wasteful number, since it uses less digits than its factorization.
50858238 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8476378.
The product of its (nonzero) digits is 76800, while the sum is 39.
The square root of 50858238 is about 7131.4961964513. The cubic root of 50858238 is about 370.4990538712.
The spelling of 50858238 in words is "fifty million, eight hundred fifty-eight thousand, two hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •