Base | Representation |
---|---|
bin | 101111000010000010… |
… | …110010001101100001 |
3 | 11211100102221102121010 |
4 | 233002002302031201 |
5 | 1311411014300423 |
6 | 35111025251133 |
7 | 3435304123230 |
oct | 570202621541 |
9 | 154312842533 |
10 | 50500150113 |
11 | 1a465022256 |
12 | 9954493aa9 |
13 | 49ba57823a |
14 | 2630d24b17 |
15 | 14a873c693 |
hex | bc20b2361 |
50500150113 has 64 divisors (see below), whose sum is σ = 80979886080. Its totient is φ = 27396475392.
The previous prime is 50500150111. The next prime is 50500150133. The reversal of 50500150113 is 31105100505.
It is not a de Polignac number, because 50500150113 - 21 = 50500150111 is a prime.
It is a super-2 number, since 2×505001501132 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 50500150113.
It is not an unprimeable number, because it can be changed into a prime (50500150111) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4650256 + ... + 4661102.
It is an arithmetic number, because the mean of its divisors is an integer number (1265310720).
Almost surely, 250500150113 is an apocalyptic number.
50500150113 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
50500150113 is a deficient number, since it is larger than the sum of its proper divisors (30479735967).
50500150113 is a wasteful number, since it uses less digits than its factorization.
50500150113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11046.
The product of its (nonzero) digits is 375, while the sum is 21.
Adding to 50500150113 its reverse (31105100505), we get a palindrome (81605250618).
The spelling of 50500150113 in words is "fifty billion, five hundred million, one hundred fifty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •