Base | Representation |
---|---|
bin | 10111001111101010010100… |
… | …11111101010110100101111 |
3 | 20200222121102221000012022020 |
4 | 23213311022133222310233 |
5 | 23144434330313334201 |
6 | 300414112532521223 |
7 | 13523661411536415 |
oct | 1347651237526457 |
9 | 220877387005266 |
10 | 51115655605551 |
11 | 15318034009269 |
12 | 5896681780213 |
13 | 226a254b11874 |
14 | c8a021dd52b5 |
15 | 5d997ec78a36 |
hex | 2e7d4a7ead2f |
51115655605551 has 32 divisors (see below), whose sum is σ = 71921947120128. Its totient is φ = 32228651136000.
The previous prime is 51115655605519. The next prime is 51115655605559. The reversal of 51115655605551 is 15550655651115.
It is not a de Polignac number, because 51115655605551 - 25 = 51115655605519 is a prime.
It is a super-2 number, since 2×511156556055512 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51115655605494 and 51115655605503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51115655605559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8398906 + ... + 13144311.
It is an arithmetic number, because the mean of its divisors is an integer number (2247560847504).
Almost surely, 251115655605551 is an apocalyptic number.
51115655605551 is a deficient number, since it is larger than the sum of its proper divisors (20806291514577).
51115655605551 is a wasteful number, since it uses less digits than its factorization.
51115655605551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21543631.
The product of its (nonzero) digits is 2812500, while the sum is 51.
The spelling of 51115655605551 in words is "fifty-one trillion, one hundred fifteen billion, six hundred fifty-five million, six hundred five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •