Base | Representation |
---|---|
bin | 1001001001101000010111… |
… | …11100100100111110001011 |
3 | 2122020122201021221121122102 |
4 | 10210310023330210332023 |
5 | 10114140101241224321 |
6 | 110443550400544015 |
7 | 4144526642466656 |
oct | 444641374447613 |
9 | 78218637847572 |
10 | 20122122211211 |
11 | 6458820450919 |
12 | 230b97602200b |
13 | b2c67b064987 |
14 | 4d7cb739289d |
15 | 24d6512dec0b |
hex | 124d0bf24f8b |
20122122211211 has 16 divisors (see below), whose sum is σ = 20558590069248. Its totient is φ = 19686003876000.
The previous prime is 20122122211091. The next prime is 20122122211253. The reversal of 20122122211211 is 11211222122102.
It is a cyclic number.
It is not a de Polignac number, because 20122122211211 - 218 = 20122121949067 is a prime.
It is a super-2 number, since 2×201221222112112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20122122211271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2032327361 + ... + 2032337261.
It is an arithmetic number, because the mean of its divisors is an integer number (1284911879328).
Almost surely, 220122122211211 is an apocalyptic number.
20122122211211 is a deficient number, since it is larger than the sum of its proper divisors (436467858037).
20122122211211 is an equidigital number, since it uses as much as digits as its factorization.
20122122211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23122.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 20122122211211 its reverse (11211222122102), we get a palindrome (31333344333313).
The spelling of 20122122211211 in words is "twenty trillion, one hundred twenty-two billion, one hundred twenty-two million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •