Base | Representation |
---|---|
bin | 10110110000101110100101… |
… | …01010111011100100011000 |
3 | 20120012222222212210021220010 |
4 | 23120113102222323210120 |
5 | 23030031102310312223 |
6 | 254241533351201520 |
7 | 13354123520232426 |
oct | 1330272252734430 |
9 | 216188885707803 |
10 | 50052788369688 |
11 | 14a482a51855a5 |
12 | 57446956762a0 |
13 | 21c0c5b07a2a0 |
14 | c507d43b2116 |
15 | 5bbec41e3393 |
hex | 2d85d2abb918 |
50052788369688 has 64 divisors (see below), whose sum is σ = 134759222357760. Its totient is φ = 15400661936256.
The previous prime is 50052788369687. The next prime is 50052788369737. The reversal of 50052788369688 is 88696388725005.
50052788369688 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50052788369687) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24556231 + ... + 26516297.
It is an arithmetic number, because the mean of its divisors is an integer number (2105612849340).
Almost surely, 250052788369688 is an apocalyptic number.
It is an amenable number.
50052788369688 is an abundant number, since it is smaller than the sum of its proper divisors (84706433988072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50052788369688 is a wasteful number, since it uses less digits than its factorization.
50052788369688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2041936 (or 2041932 counting only the distinct ones).
The product of its (nonzero) digits is 1393459200, while the sum is 75.
The spelling of 50052788369688 in words is "fifty trillion, fifty-two billion, seven hundred eighty-eight million, three hundred sixty-nine thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •