Base | Representation |
---|---|
bin | 10110111110000110001011… |
… | …01000011011110011001101 |
3 | 20121211220122021012022210001 |
4 | 23133003011220123303031 |
5 | 23110042321031042031 |
6 | 255232541440244301 |
7 | 13432244461146406 |
oct | 1337030550336315 |
9 | 217756567168701 |
10 | 50512131112141 |
11 | 151050901896a6 |
12 | 57b970a610691 |
13 | 2225372c202ca |
14 | c68b2ba189ad |
15 | 5c8e0a7b1861 |
hex | 2df0c5a1bccd |
50512131112141 has 4 divisors (see below), whose sum is σ = 50517882245952. Its totient is φ = 50506379978332.
The previous prime is 50512131112139. The next prime is 50512131112207. The reversal of 50512131112141 is 14121113121505.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 50512131112141 - 21 = 50512131112139 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50512131112741) 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, 2875553731 + ... + 2875571296.
It is an arithmetic number, because the mean of its divisors is an integer number (12629470561488).
Almost surely, 250512131112141 is an apocalyptic number.
It is an amenable number.
50512131112141 is a deficient number, since it is larger than the sum of its proper divisors (5751133811).
50512131112141 is an equidigital number, since it uses as much as digits as its factorization.
50512131112141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5751133810.
The product of its (nonzero) digits is 1200, while the sum is 28.
Adding to 50512131112141 its reverse (14121113121505), we get a palindrome (64633244233646).
The spelling of 50512131112141 in words is "fifty trillion, five hundred twelve billion, one hundred thirty-one million, one hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •