Base | Representation |
---|---|
bin | 10110111110000100010001… |
… | …11000111111110111101100 |
3 | 20121211211000020122022010000 |
4 | 23133002020320333313230 |
5 | 23110033224140402022 |
6 | 255232252354144300 |
7 | 13432210305210324 |
oct | 1337021070776754 |
9 | 217754006568100 |
10 | 50511112044012 |
11 | 15104707a21734 |
12 | 57b9485282090 |
13 | 222523ca67c09 |
14 | c68a72546284 |
15 | 5c8d9b0b56ac |
hex | 2df088e3fdec |
50511112044012 has 30 divisors (see below), whose sum is σ = 132046024387508. Its totient is φ = 16837037347896.
The previous prime is 50511112043989. The next prime is 50511112044013. The reversal of 50511112044012 is 21044021111505.
50511112044012 is a `hidden beast` number, since 5 + 0 + 51 + 1 + 1 + 1 + 204 + 401 + 2 = 666.
It is a super-2 number, since 2×505111120440122 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (50511112044013) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 77949246658 + ... + 77949247305.
Almost surely, 250511112044012 is an apocalyptic number.
It is an amenable number.
50511112044012 is an abundant number, since it is smaller than the sum of its proper divisors (81534912343496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50511112044012 is a wasteful number, since it uses less digits than its factorization.
50511112044012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155898493979 (or 155898493968 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 27.
Adding to 50511112044012 its reverse (21044021111505), we get a palindrome (71555133155517).
The spelling of 50511112044012 in words is "fifty trillion, five hundred eleven billion, one hundred twelve million, forty-four thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •