Base | Representation |
---|---|
bin | 10111010000001010000000… |
… | …00010110011100010111101 |
3 | 20201001020100000000211222220 |
4 | 23220011000002303202331 |
5 | 23200224141443324000 |
6 | 300430004134555553 |
7 | 13525132661630331 |
oct | 1350050002634275 |
9 | 221036300024886 |
10 | 51132660136125 |
11 | 1532426a691817 |
12 | 5899a28508bb9 |
13 | 226ba34a30189 |
14 | c8ab965337c1 |
15 | 5da127a481a0 |
hex | 2e81400b38bd |
51132660136125 has 128 divisors (see below), whose sum is σ = 87143715869184. Its totient is φ = 26619072768000.
The previous prime is 51132660136121. The next prime is 51132660136133. The reversal of 51132660136125 is 52163106623115.
It is a happy number.
It is not a de Polignac number, because 51132660136125 - 22 = 51132660136121 is a prime.
It is a super-2 number, since 2×511326601361252 (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 (51132660136121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 3107793399 + ... + 3107809851.
It is an arithmetic number, because the mean of its divisors is an integer number (680810280228).
Almost surely, 251132660136125 is an apocalyptic number.
It is an amenable number.
51132660136125 is a deficient number, since it is larger than the sum of its proper divisors (36011055733059).
51132660136125 is a wasteful number, since it uses less digits than its factorization.
51132660136125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17712 (or 17702 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 42.
The spelling of 51132660136125 in words is "fifty-one trillion, one hundred thirty-two billion, six hundred sixty million, one hundred thirty-six thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •