Base | Representation |
---|---|
bin | 10110110101000011000010… |
… | …10011101100110111110011 |
3 | 20120202012002122212002000102 |
4 | 23122201201103230313303 |
5 | 23034444034314411011 |
6 | 254434041224343015 |
7 | 13400626535014106 |
oct | 1332414123546763 |
9 | 216665078762012 |
10 | 50201210310131 |
11 | 14aa52395281a1 |
12 | 57693b7914a6b |
13 | 2201c5270639a |
14 | c57a7434073d |
15 | 5c0cae4a973b |
hex | 2da8614ecdf3 |
50201210310131 has 4 divisors (see below), whose sum is σ = 50361597563832. Its totient is φ = 50040823056432.
The previous prime is 50201210310127. The next prime is 50201210310137. The reversal of 50201210310131 is 13101301210205.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 50201210310131 - 22 = 50201210310127 is a prime.
It is a super-2 number, since 2×502012103101312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50201210310137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 80193626381 + ... + 80193627006.
It is an arithmetic number, because the mean of its divisors is an integer number (12590399390958).
Almost surely, 250201210310131 is an apocalyptic number.
50201210310131 is a deficient number, since it is larger than the sum of its proper divisors (160387253701).
50201210310131 is a wasteful number, since it uses less digits than its factorization.
50201210310131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160387253700.
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 50201210310131 its reverse (13101301210205), we get a palindrome (63302511520336).
The spelling of 50201210310131 in words is "fifty trillion, two hundred one billion, two hundred ten million, three hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •