Base | Representation |
---|---|
bin | 10110110000101001100000… |
… | …001110011111011101110011 |
3 | 111010102110220121220220011121 |
4 | 112300221200032133131303 |
5 | 101110020022241242321 |
6 | 552521210013123111 |
7 | 30040665225664462 |
oct | 2660514016373563 |
9 | 433373817826147 |
10 | 100100122212211 |
11 | 29993250425100 |
12 | b2880a8489497 |
13 | 43b152a0754b4 |
14 | 1aa0c2c1a69d9 |
15 | b88c795ea441 |
hex | 5b0a6039f773 |
100100122212211 has 24 divisors (see below), whose sum is σ = 110177335542960. Its totient is φ = 90876166318080.
The previous prime is 100100122212199. The next prime is 100100122212221. The reversal of 100100122212211 is 112212221001001.
It is not a de Polignac number, because 100100122212211 - 215 = 100100122179443 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100100122212221) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 398589195 + ... + 398840251.
It is an arithmetic number, because the mean of its divisors is an integer number (4590722314290).
Almost surely, 2100100122212211 is an apocalyptic number.
100100122212211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100100122212211 is a deficient number, since it is larger than the sum of its proper divisors (10077213330749).
100100122212211 is a wasteful number, since it uses less digits than its factorization.
100100122212211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255555 (or 255544 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 100100122212211 its reverse (112212221001001), we get a palindrome (212312343213212).
The spelling of 100100122212211 in words is "one hundred trillion, one hundred billion, one hundred twenty-two million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •