Base | Representation |
---|---|
bin | 10111001111001111001001… |
… | …00011110001110110110011 |
3 | 20200221012202202202021020222 |
4 | 23213213210203301312303 |
5 | 23144214432442130021 |
6 | 300403300401123255 |
7 | 13522633626326036 |
oct | 1347474443616663 |
9 | 220835682667228 |
10 | 51101060505011 |
11 | 153119244a9200 |
12 | 589388992952b |
13 | 2268a6a1311ba |
14 | c8943988d01d |
15 | 5d93c87946ab |
hex | 2e79e48f1db3 |
51101060505011 has 12 divisors (see below), whose sum is σ = 56170981848072. Its totient is φ = 46453816068000.
The previous prime is 51101060504953. The next prime is 51101060505059. The reversal of 51101060505011 is 11050506010115.
It is a de Polignac number, because none of the positive numbers 2k-51101060505011 is a prime.
It is a super-2 number, since 2×511010605050112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51101060505311) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4358705 + ... + 11009106.
It is an arithmetic number, because the mean of its divisors is an integer number (4680915154006).
Almost surely, 251101060505011 is an apocalyptic number.
51101060505011 is a deficient number, since it is larger than the sum of its proper divisors (5069921343061).
51101060505011 is a wasteful number, since it uses less digits than its factorization.
51101060505011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15395314 (or 15395303 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 26.
Adding to 51101060505011 its reverse (11050506010115), we get a palindrome (62151566515126).
The spelling of 51101060505011 in words is "fifty-one trillion, one hundred one billion, sixty million, five hundred five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •