Base | Representation |
---|---|
bin | 1010001011111111101110… |
… | …1010101101111100001111 |
3 | 1110122211021000202022102012 |
4 | 2202333323222231330033 |
5 | 2432010030204120421 |
6 | 35453432225051435 |
7 | 2234155141141205 |
oct | 242777352557417 |
9 | 43584230668365 |
10 | 11201202020111 |
11 | 3629448586664 |
12 | 130aa4ba86b7b |
13 | 63336579401c |
14 | 2aa1d9151075 |
15 | 14658041795b |
hex | a2ffbaadf0f |
11201202020111 has 4 divisors (see below), whose sum is σ = 11474402069424. Its totient is φ = 10928001970800.
The previous prime is 11201202020093. The next prime is 11201202020131. The reversal of 11201202020111 is 11102020210211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11201202020111 - 214 = 11201202003727 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 (11201202020131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 136600024595 + ... + 136600024676.
It is an arithmetic number, because the mean of its divisors is an integer number (2868600517356).
Almost surely, 211201202020111 is an apocalyptic number.
11201202020111 is a deficient number, since it is larger than the sum of its proper divisors (273200049313).
11201202020111 is an equidigital number, since it uses as much as digits as its factorization.
11201202020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273200049312.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11201202020111 its reverse (11102020210211), we get a palindrome (22303222230322).
The spelling of 11201202020111 in words is "eleven trillion, two hundred one billion, two hundred two million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •