Base | Representation |
---|---|
bin | 10111011101110000101011… |
… | …11011100000101100101111 |
3 | 20202200220220001001010010201 |
4 | 23232320111323200230233 |
5 | 23230404003341003421 |
6 | 301424432213014331 |
7 | 13603661463561451 |
oct | 1356702573405457 |
9 | 222626801033121 |
10 | 51600105016111 |
11 | 15494533084753 |
12 | 59545429243a7 |
13 | 22a3b3b327a12 |
14 | ca565bc302d1 |
15 | 5e7385589b91 |
hex | 2eee15ee0b2f |
51600105016111 has 4 divisors (see below), whose sum is σ = 51600147962800. Its totient is φ = 51600062069424.
The previous prime is 51600105016049. The next prime is 51600105016121. The reversal of 51600105016111 is 11161050100615.
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 51600105016111 - 217 = 51600104885039 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51600105016111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51600105016121) 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, 19617651 + ... + 22091908.
It is an arithmetic number, because the mean of its divisors is an integer number (12900036990700).
Almost surely, 251600105016111 is an apocalyptic number.
51600105016111 is a deficient number, since it is larger than the sum of its proper divisors (42946689).
51600105016111 is a wasteful number, since it uses less digits than its factorization.
51600105016111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42946688.
The product of its (nonzero) digits is 900, while the sum is 28.
Adding to 51600105016111 its reverse (11161050100615), we get a palindrome (62761155116726).
The spelling of 51600105016111 in words is "fifty-one trillion, six hundred billion, one hundred five million, sixteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •