Base | Representation |
---|---|
bin | 1001001001000001000100… |
… | …10010011110000001110011 |
3 | 2122011122020210120121102222 |
4 | 10210200202102132001303 |
5 | 10113313343141242321 |
6 | 110430140534431255 |
7 | 4143152032452623 |
oct | 444404222360163 |
9 | 78148223517388 |
10 | 20101022212211 |
11 | 644a883008316 |
12 | 230786780252b |
13 | b2a697809975 |
14 | 4d6c74d6c883 |
15 | 24cd18bdd3ab |
hex | 12482249e073 |
20101022212211 has 16 divisors (see below), whose sum is σ = 20246277444096. Its totient is φ = 19956343680000.
The previous prime is 20101022212169. The next prime is 20101022212223. The reversal of 20101022212211 is 11221222010102.
It is a cyclic number.
It is not a de Polignac number, because 20101022212211 - 210 = 20101022211187 is a prime.
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 20101022212211.
It is not an unprimeable number, because it can be changed into a prime (20101022212261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 149181791 + ... + 149316471.
It is an arithmetic number, because the mean of its divisors is an integer number (1265392340256).
Almost surely, 220101022212211 is an apocalyptic number.
20101022212211 is a deficient number, since it is larger than the sum of its proper divisors (145255231885).
20101022212211 is a wasteful number, since it uses less digits than its factorization.
20101022212211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136814.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20101022212211 its reverse (11221222010102), we get a palindrome (31322244222313).
The spelling of 20101022212211 in words is "twenty trillion, one hundred one billion, twenty-two million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •