Base | Representation |
---|---|
bin | 10110110000111100111101… |
… | …111001000111011101110110 |
3 | 111010111110212002201022221112 |
4 | 112300330331321013131312 |
5 | 101110340322340120042 |
6 | 552534543451115022 |
7 | 30042335143633352 |
oct | 2660747571073566 |
9 | 433443762638845 |
10 | 100121021020022 |
11 | 299a10a52417a2 |
12 | b29015b442a72 |
13 | 43b34aaa19c72 |
14 | 1aa1c519b8462 |
15 | b8959e209982 |
hex | 5b0f3de47776 |
100121021020022 has 16 divisors (see below), whose sum is σ = 151668916837344. Its totient is φ = 49564718280000.
The previous prime is 100121021019961. The next prime is 100121021020037. The reversal of 100121021020022 is 220020120121001.
It is a junction number, because it is equal to n+sod(n) for n = 100121021019979 and 100121021020006.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 116082122 + ... + 116941442.
It is an arithmetic number, because the mean of its divisors is an integer number (9479307302334).
Almost surely, 2100121021020022 is an apocalyptic number.
100121021020022 is a deficient number, since it is larger than the sum of its proper divisors (51547895817322).
100121021020022 is a wasteful number, since it uses less digits than its factorization.
100121021020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1436215.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 100121021020022 its reverse (220020120121001), we get a palindrome (320141141141023).
The spelling of 100121021020022 in words is "one hundred trillion, one hundred twenty-one billion, twenty-one million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •