Base | Representation |
---|---|
bin | 1001000110011001100101… |
… | …01000100000100111010011 |
3 | 2121212001011010001020111220 |
4 | 10203030302220200213103 |
5 | 10110330214120042321 |
6 | 110320550130540123 |
7 | 4133516523304650 |
oct | 443146250404723 |
9 | 77761133036456 |
10 | 20011102112211 |
11 | 641572a4aa291 |
12 | 22b2351737643 |
13 | b220674113c2 |
14 | 4d278490cc27 |
15 | 24a8048959c6 |
hex | 123332a209d3 |
20011102112211 has 16 divisors (see below), whose sum is σ = 30493417192704. Its totient is φ = 11434799538144.
The previous prime is 20011102112191. The next prime is 20011102112297. The reversal of 20011102112211 is 11221120111002.
It is a happy number.
It is not a de Polignac number, because 20011102112211 - 27 = 20011102112083 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20011102110211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2689116 + ... + 6874121.
It is an arithmetic number, because the mean of its divisors is an integer number (1905838574544).
Almost surely, 220011102112211 is an apocalyptic number.
20011102112211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20011102112211 is a deficient number, since it is larger than the sum of its proper divisors (10482315080493).
20011102112211 is an equidigital number, since it uses as much as digits as its factorization.
20011102112211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9662890.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 20011102112211 its reverse (11221120111002), we get a palindrome (31232222223213).
The spelling of 20011102112211 in words is "twenty trillion, eleven billion, one hundred two million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •