Base | Representation |
---|---|
bin | 1010001100101000000010… |
… | …0101101111100000001111 |
3 | 1110200212012002111021001221 |
4 | 2203022000211233200033 |
5 | 2432144210114120421 |
6 | 35502422023144211 |
7 | 2235020233465543 |
oct | 243120045574017 |
9 | 43625162437057 |
10 | 11212022020111 |
11 | 3632aa0151820 |
12 | 1310b6b5a5067 |
13 | 63439b3177a3 |
14 | 2aa944167a23 |
15 | 1469b529d841 |
hex | a328096f80f |
11212022020111 has 16 divisors (see below), whose sum is σ = 12750863210496. Its totient is φ = 9766286100000.
The previous prime is 11212022020099. The next prime is 11212022020193. The reversal of 11212022020111 is 11102022021211.
It is a cyclic number.
It is not a de Polignac number, because 11212022020111 - 27 = 11212022019983 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11212022024111) 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, 162736995 + ... + 162805876.
It is an arithmetic number, because the mean of its divisors is an integer number (796928950656).
Almost surely, 211212022020111 is an apocalyptic number.
11212022020111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11212022020111 is a deficient number, since it is larger than the sum of its proper divisors (1538841190385).
11212022020111 is a wasteful number, since it uses less digits than its factorization.
11212022020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325543014.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11212022020111 its reverse (11102022021211), we get a palindrome (22314044041322).
The spelling of 11212022020111 in words is "eleven trillion, two hundred twelve billion, twenty-two million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •