Base | Representation |
---|---|
bin | 10110101111010110100111… |
… | …011010011110000010011011 |
3 | 111010002222012001201220111122 |
4 | 112233112213122132002123 |
5 | 101102040234242034321 |
6 | 552412250354315455 |
7 | 30031364561360165 |
oct | 2657264732360233 |
9 | 433088161656448 |
10 | 100011122221211 |
11 | 2995952a233633 |
12 | b2729aa588b8b |
13 | 43a6015494526 |
14 | 1a9a7c8019935 |
15 | b867bae528ab |
hex | 5af5a769e09b |
100011122221211 has 16 divisors (see below), whose sum is σ = 106719542042400. Its totient is φ = 93397220663808.
The previous prime is 100011122221201. The next prime is 100011122221247. The reversal of 100011122221211 is 112122221110001.
It is a cyclic number.
It is not a de Polignac number, because 100011122221211 - 246 = 29642378043547 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100011122221211.
It is not an unprimeable number, because it can be changed into a prime (100011122221201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42698921 + ... + 44980218.
It is an arithmetic number, because the mean of its divisors is an integer number (6669971377650).
Almost surely, 2100011122221211 is an apocalyptic number.
100011122221211 is a deficient number, since it is larger than the sum of its proper divisors (6708419821189).
100011122221211 is a wasteful number, since it uses less digits than its factorization.
100011122221211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87679678.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 100011122221211 its reverse (112122221110001), we get a palindrome (212133343331212).
The spelling of 100011122221211 in words is "one hundred trillion, eleven billion, one hundred twenty-two million, two hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •