Base | Representation |
---|---|
bin | 101111000010000010… |
… | …101000101100101111 |
3 | 11211100102212110011002 |
4 | 233002002220230233 |
5 | 1311411012024101 |
6 | 35111024350515 |
7 | 3435303601520 |
oct | 570202505457 |
9 | 154312773132 |
10 | 50500111151 |
11 | 1a464aa5a56 |
12 | 995447543b |
13 | 49ba563599 |
14 | 2630d14847 |
15 | 14a8730d6b |
hex | bc20a8b2f |
50500111151 has 16 divisors (see below), whose sum is σ = 58086244608. Its totient is φ = 43007500800.
The previous prime is 50500111111. The next prime is 50500111157. The reversal of 50500111151 is 15111100505.
It is a cyclic number.
It is not a de Polignac number, because 50500111151 - 26 = 50500111087 is a prime.
It is a super-2 number, since 2×505001111512 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50500111157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1072616 + ... + 1118706.
It is an arithmetic number, because the mean of its divisors is an integer number (3630390288).
Almost surely, 250500111151 is an apocalyptic number.
50500111151 is a deficient number, since it is larger than the sum of its proper divisors (7586133457).
50500111151 is a wasteful number, since it uses less digits than its factorization.
50500111151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47102.
The product of its (nonzero) digits is 125, while the sum is 20.
Adding to 50500111151 its reverse (15111100505), we get a palindrome (65611211656).
The spelling of 50500111151 in words is "fifty billion, five hundred million, one hundred eleven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •