Base | Representation |
---|---|
bin | 10111001111001111110101… |
… | …11101110000000110010111 |
3 | 20200221020201222002100010120 |
4 | 23213213322331300012113 |
5 | 23144221220210143221 |
6 | 300403401550123023 |
7 | 13522646142434505 |
oct | 1347477275600627 |
9 | 220836658070116 |
10 | 51101436412311 |
11 | 15311aa770899a |
12 | 58939737b0473 |
13 | 2268ac9c8855c |
14 | c89473781675 |
15 | 5d93eb7995c6 |
hex | 2e79faf70197 |
51101436412311 has 16 divisors (see below), whose sum is σ = 72143409097728. Its totient is φ = 32063555376000.
The previous prime is 51101436412307. The next prime is 51101436412337. The reversal of 51101436412311 is 11321463410115.
It is not a de Polignac number, because 51101436412311 - 22 = 51101436412307 is a prime.
It is a super-2 number, since 2×511014364123112 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51101436412361) 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, 19798746 + ... + 22230456.
It is an arithmetic number, because the mean of its divisors is an integer number (4508963068608).
Almost surely, 251101436412311 is an apocalyptic number.
51101436412311 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
51101436412311 is a deficient number, since it is larger than the sum of its proper divisors (21041972685417).
51101436412311 is a wasteful number, since it uses less digits than its factorization.
51101436412311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2843782.
The product of its (nonzero) digits is 8640, while the sum is 33.
Adding to 51101436412311 its reverse (11321463410115), we get a palindrome (62422899822426).
The spelling of 51101436412311 in words is "fifty-one trillion, one hundred one billion, four hundred thirty-six million, four hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •