Base | Representation |
---|---|
bin | 1010000110001110001011… |
… | …0001110011110110010111 |
3 | 1110022100012111000202122202 |
4 | 2201203202301303312113 |
5 | 2423343344022413421 |
6 | 35340104413515115 |
7 | 2224043625452051 |
oct | 241434261636627 |
9 | 43270174022582 |
10 | 11102000201111 |
11 | 35a0371759786 |
12 | 12b37854a2a9b |
13 | 626bb644b541 |
14 | 2a54a81048d1 |
15 | 143bc62e610b |
hex | a18e2c73d97 |
11102000201111 has 2 divisors, whose sum is σ = 11102000201112. Its totient is φ = 11102000201110.
The previous prime is 11102000201107. The next prime is 11102000201129. The reversal of 11102000201111 is 11110200020111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11102000201111 - 22 = 11102000201107 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11102000201092 and 11102000201101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11102000201101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551000100555 + 5551000100556.
It is an arithmetic number, because the mean of its divisors is an integer number (5551000100556).
Almost surely, 211102000201111 is an apocalyptic number.
11102000201111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102000201111 is an equidigital number, since it uses as much as digits as its factorization.
11102000201111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11102000201111 its reverse (11110200020111), we get a palindrome (22212200221222).
The spelling of 11102000201111 in words is "eleven trillion, one hundred two billion, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •