Base | Representation |
---|---|
bin | 10110110000111101111000… |
… | …110110001100100010011110 |
3 | 111010111120102000212022110202 |
4 | 112300331320312030202132 |
5 | 101110344334042010420 |
6 | 552535225542503502 |
7 | 30042401514025052 |
oct | 2660757066144236 |
9 | 433446360768422 |
10 | 100122010110110 |
11 | 299a156259381a |
12 | b290396734b92 |
13 | 43b3607907381 |
14 | 1aa1d070c5c62 |
15 | b8960ae83575 |
hex | 5b0f78d8c89e |
100122010110110 has 32 divisors (see below), whose sum is σ = 186936947128800. Its totient is φ = 38581581201408.
The previous prime is 100122010110061. The next prime is 100122010110137. The reversal of 100122010110110 is 11011010221001.
It is a junction number, because it is equal to n+sod(n) for n = 100122010110091 and 100122010110100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1594776035 + ... + 1594838814.
It is an arithmetic number, because the mean of its divisors is an integer number (5841779597775).
Almost surely, 2100122010110110 is an apocalyptic number.
100122010110110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100122010110110 is a deficient number, since it is larger than the sum of its proper divisors (86814937018690).
100122010110110 is a wasteful number, since it uses less digits than its factorization.
100122010110110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3189614972.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100122010110110 its reverse (11011010221001), we get a palindrome (111133020331111).
The spelling of 100122010110110 in words is "one hundred trillion, one hundred twenty-two billion, ten million, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •