Base | Representation |
---|---|
bin | 1010001100100100010011… |
… | …1111000010111001110011 |
3 | 1110200202121101211000002121 |
4 | 2203021010333002321303 |
5 | 2432140133114121321 |
6 | 35502134501455111 |
7 | 2234653401565126 |
oct | 243110477027163 |
9 | 43622541730077 |
10 | 11211022020211 |
11 | 3632627729022 |
12 | 1310930711497 |
13 | 63426c0aa680 |
14 | 2aa88b41a3bd |
15 | 1469575bc441 |
hex | a3244fc2e73 |
11211022020211 has 4 divisors (see below), whose sum is σ = 12073408329472. Its totient is φ = 10348635710952.
The previous prime is 11211022020199. The next prime is 11211022020227. The reversal of 11211022020211 is 11202022011211.
11211022020211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11211022020211 - 27 = 11211022020083 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11211022020271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 431193154611 + ... + 431193154636.
It is an arithmetic number, because the mean of its divisors is an integer number (3018352082368).
Almost surely, 211211022020211 is an apocalyptic number.
11211022020211 is a deficient number, since it is larger than the sum of its proper divisors (862386309261).
11211022020211 is an equidigital number, since it uses as much as digits as its factorization.
11211022020211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 862386309260.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11211022020211 its reverse (11202022011211), we get a palindrome (22413044031422).
The spelling of 11211022020211 in words is "eleven trillion, two hundred eleven billion, twenty-two million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •