Base | Representation |
---|---|
bin | 10110101111001110001000… |
… | …01101010000000000011111 |
3 | 20120001001100002022110120202 |
4 | 23113213010031100000133 |
5 | 23023204030030204021 |
6 | 254202051201334115 |
7 | 13350311354220554 |
oct | 1327470415200037 |
9 | 216031302273522 |
10 | 50001006100511 |
11 | 14a28342469314 |
12 | 573664393733b |
13 | 21b90c7cb7b1b |
14 | c4c0c10a2a2b |
15 | 5ba993148a0b |
hex | 2d79c435001f |
50001006100511 has 8 divisors (see below), whose sum is σ = 50364709368960. Its totient is φ = 49637359743768.
The previous prime is 50001006100427. The next prime is 50001006100543. The reversal of 50001006100511 is 11500160010005.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50001006100511 is a prime.
It is a super-2 number, since 2×500010061005112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50001006100561) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12463601 + ... + 15979466.
It is an arithmetic number, because the mean of its divisors is an integer number (6295588671120).
Almost surely, 250001006100511 is an apocalyptic number.
50001006100511 is a deficient number, since it is larger than the sum of its proper divisors (363703268449).
50001006100511 is a wasteful number, since it uses less digits than its factorization.
50001006100511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28455853.
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 50001006100511 its reverse (11500160010005), we get a palindrome (61501166110516).
The spelling of 50001006100511 in words is "fifty trillion, one billion, six million, one hundred thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •