Base | Representation |
---|---|
bin | 1010000110000111011110… |
… | …0010110111010101010111 |
3 | 1110022011120002202000212011 |
4 | 2201201313202313111113 |
5 | 2423331202441333421 |
6 | 35335210105205051 |
7 | 2223651221515624 |
oct | 241416742672527 |
9 | 43264502660764 |
10 | 11100201121111 |
11 | 359a629173303 |
12 | 12b3362a90787 |
13 | 62698a7c116b |
14 | 2a53771cb34b |
15 | 143b1d3c04e1 |
hex | a18778b7557 |
11100201121111 has 2 divisors, whose sum is σ = 11100201121112. Its totient is φ = 11100201121110.
The previous prime is 11100201121109. The next prime is 11100201121147. The reversal of 11100201121111 is 11112110200111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11100201121111 - 21 = 11100201121109 is a prime.
It is a super-2 number, since 2×111002011211112 (a number of 27 digits) contains 22 as substring.
Together with 11100201121109, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 11100201121091 and 11100201121100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11100201121411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550100560555 + 5550100560556.
It is an arithmetic number, because the mean of its divisors is an integer number (5550100560556).
Almost surely, 211100201121111 is an apocalyptic number.
11100201121111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11100201121111 is an equidigital number, since it uses as much as digits as its factorization.
11100201121111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11100201121111 its reverse (11112110200111), we get a palindrome (22212311321222).
The spelling of 11100201121111 in words is "eleven trillion, one hundred billion, two hundred one million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •