Base | Representation |
---|---|
bin | 101111000010110000… |
… | …110000010110101011 |
3 | 11211101021121200111010 |
4 | 233002300300112223 |
5 | 1311422110414011 |
6 | 35112135435003 |
7 | 3435511424340 |
oct | 570260602653 |
9 | 154337550433 |
10 | 50512201131 |
11 | 1a470903377 |
12 | 9958525a63 |
13 | 49bcc07512 |
14 | 26327807c7 |
15 | 14a981d1a6 |
hex | bc2c305ab |
50512201131 has 32 divisors (see below), whose sum is σ = 80930534400. Its totient is φ = 27411914880.
The previous prime is 50512201121. The next prime is 50512201151. The reversal of 50512201131 is 13110221505.
It is not a de Polignac number, because 50512201131 - 26 = 50512201067 is a prime.
It is a super-2 number, since 2×505122011312 (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 junction number, because it is equal to n+sod(n) for n = 50512201098 and 50512201107.
It is not an unprimeable number, because it can be changed into a prime (50512201121) 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 31 ways as a sum of consecutive naturals, for example, 642711 + ... + 717008.
It is an arithmetic number, because the mean of its divisors is an integer number (2529079200).
Almost surely, 250512201131 is an apocalyptic number.
50512201131 is a deficient number, since it is larger than the sum of its proper divisors (30418333269).
50512201131 is a wasteful number, since it uses less digits than its factorization.
50512201131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1359819.
The product of its (nonzero) digits is 300, while the sum is 21.
Adding to 50512201131 its reverse (13110221505), we get a palindrome (63622422636).
The spelling of 50512201131 in words is "fifty billion, five hundred twelve million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •