Base | Representation |
---|---|
bin | 10111010010011101000111… |
… | …11010101000000110110010 |
3 | 20201022210012121020000112210 |
4 | 23221032203322220012302 |
5 | 23203022422123000132 |
6 | 300530145513232550 |
7 | 13533630210151053 |
oct | 1351164372500662 |
9 | 221283177200483 |
10 | 51211645125042 |
11 | 15354811651a66 |
12 | 58b11b0402756 |
13 | 22763117a03cc |
14 | c9092a57472a |
15 | 5dc1ebd6cbcc |
hex | 2e93a3ea81b2 |
51211645125042 has 64 divisors (see below), whose sum is σ = 103896225417600. Its totient is φ = 16826330949120.
The previous prime is 51211645125031. The next prime is 51211645125049. The reversal of 51211645125042 is 24052154611215.
51211645125042 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (51211645125049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 230137309 + ... + 230359727.
It is an arithmetic number, because the mean of its divisors is an integer number (1623378522150).
Almost surely, 251211645125042 is an apocalyptic number.
51211645125042 is an abundant number, since it is smaller than the sum of its proper divisors (52684580292558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51211645125042 is a wasteful number, since it uses less digits than its factorization.
51211645125042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223851.
The product of its (nonzero) digits is 96000, while the sum is 39.
Adding to 51211645125042 its reverse (24052154611215), we get a palindrome (75263799736257).
The spelling of 51211645125042 in words is "fifty-one trillion, two hundred eleven billion, six hundred forty-five million, one hundred twenty-five thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •