Base | Representation |
---|---|
bin | 1010001011111111110000… |
… | …1101010110101111001111 |
3 | 1110122211021122211121211111 |
4 | 2202333330031112233033 |
5 | 2432010040020200421 |
6 | 35453433151432451 |
7 | 2234155311256414 |
oct | 242777415265717 |
9 | 43584248747744 |
10 | 11201211100111 |
11 | 362945271859a |
12 | 130aa52b25727 |
13 | 633367622bc6 |
14 | 2aa1da43610b |
15 | 14658110cee1 |
hex | a2ffc356bcf |
11201211100111 has 4 divisors (see below), whose sum is σ = 11275391306224. Its totient is φ = 11127030894000.
The previous prime is 11201211100087. The next prime is 11201211100117. The reversal of 11201211100111 is 11100111210211.
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 11201211100111 - 231 = 11199063616463 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11201211100091 and 11201211100100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11201211100117) 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, 37090102830 + ... + 37090103131.
It is an arithmetic number, because the mean of its divisors is an integer number (2818847826556).
Almost surely, 211201211100111 is an apocalyptic number.
11201211100111 is a deficient number, since it is larger than the sum of its proper divisors (74180206113).
11201211100111 is an equidigital number, since it uses as much as digits as its factorization.
11201211100111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74180206112.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11201211100111 its reverse (11100111210211), we get a palindrome (22301322310322).
The spelling of 11201211100111 in words is "eleven trillion, two hundred one billion, two hundred eleven million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •