Base | Representation |
---|---|
bin | 10110101111001101001101… |
… | …011001101001100000011011 |
3 | 111010002000010011121201002111 |
4 | 112233031031121221200123 |
5 | 101101404043130401021 |
6 | 552403500234213151 |
7 | 30030556360060633 |
oct | 2657151531514033 |
9 | 433060104551074 |
10 | 100001022122011 |
11 | 29955216a6a60a |
12 | b270a4bb841b7 |
13 | 43a5095b2a37a |
14 | 1a9a10a87b6c3 |
15 | b863c93c08e1 |
hex | 5af34d66981b |
100001022122011 has 8 divisors (see below), whose sum is σ = 100053402677840. Its totient is φ = 99948649216032.
The previous prime is 100001022121997. The next prime is 100001022122063. The reversal of 100001022122011 is 110221220100001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100001022122011 - 211 = 100001022119963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100001022121982 and 100001022122000.
It is not an unprimeable number, because it can be changed into a prime (100001022122411) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24333205 + ... + 28144393.
It is an arithmetic number, because the mean of its divisors is an integer number (12506675334730).
Almost surely, 2100001022122011 is an apocalyptic number.
100001022122011 is a deficient number, since it is larger than the sum of its proper divisors (52380555829).
100001022122011 is a wasteful number, since it uses less digits than its factorization.
100001022122011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3824925.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100001022122011 its reverse (110221220100001), we get a palindrome (210222242222012).
The spelling of 100001022122011 in words is "one hundred trillion, one billion, twenty-two million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •