Base | Representation |
---|---|
bin | 1001001001101000010110… |
… | …10101101000000001110000 |
3 | 2122020122200120201211122120 |
4 | 10210310023111220001300 |
5 | 10114140041133000422 |
6 | 110443545354034240 |
7 | 4144526456631003 |
oct | 444641325500160 |
9 | 78218616654576 |
10 | 20122112000112 |
11 | 64588157070a1 |
12 | 230b972718980 |
13 | b2c678bcacc5 |
14 | 4d7cb5c9553a |
15 | 24d65047445c |
hex | 124d0b568070 |
20122112000112 has 80 divisors (see below), whose sum is σ = 52039174041600. Its totient is φ = 6700011422976.
The previous prime is 20122112000083. The next prime is 20122112000129. The reversal of 20122112000112 is 21100021122102.
It is a junction number, because it is equal to n+sod(n) for n = 20122112000091 and 20122112000100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 323407918 + ... + 323470130.
It is an arithmetic number, because the mean of its divisors is an integer number (650489675520).
Almost surely, 220122112000112 is an apocalyptic number.
It is an amenable number.
20122112000112 is an abundant number, since it is smaller than the sum of its proper divisors (31917062041488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20122112000112 is a wasteful number, since it uses less digits than its factorization.
20122112000112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69510 (or 69504 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20122112000112 its reverse (21100021122102), we get a palindrome (41222133122214).
The spelling of 20122112000112 in words is "twenty trillion, one hundred twenty-two billion, one hundred twelve million, one hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •