Base | Representation |
---|---|
bin | 10111001111110101000010… |
… | …01101010000001000010111 |
3 | 20201000011021122012010100010 |
4 | 23213322201031100020113 |
5 | 23200033114233101321 |
6 | 300420503250051303 |
7 | 13524254036632005 |
oct | 1347724115201027 |
9 | 221004248163303 |
10 | 51121405362711 |
11 | 1531a51465a992 |
12 | 5897807279b33 |
13 | 226a9600b1538 |
14 | c8a4098a3a75 |
15 | 5d9bb9930676 |
hex | 2e7ea1350217 |
51121405362711 has 16 divisors (see below), whose sum is σ = 69124920369408. Its totient is φ = 33599455579200.
The previous prime is 51121405362667. The next prime is 51121405362743. The reversal of 51121405362711 is 11726350412115.
It is not a de Polignac number, because 51121405362711 - 223 = 51121396974103 is a prime.
It is a super-2 number, since 2×511214053627112 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 51121405362711.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51121405362791) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 346285 + ... + 10117446.
It is an arithmetic number, because the mean of its divisors is an integer number (4320307523088).
Almost surely, 251121405362711 is an apocalyptic number.
51121405362711 is a deficient number, since it is larger than the sum of its proper divisors (18003515006697).
51121405362711 is a wasteful number, since it uses less digits than its factorization.
51121405362711 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10486742.
The product of its (nonzero) digits is 50400, while the sum is 39.
Adding to 51121405362711 its reverse (11726350412115), we get a palindrome (62847755774826).
The spelling of 51121405362711 in words is "fifty-one trillion, one hundred twenty-one billion, four hundred five million, three hundred sixty-two thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •