Base | Representation |
---|---|
bin | 1010000001011101110101… |
… | …0000100001101001111011 |
3 | 1110000112022212201200001001 |
4 | 2200113131100201221323 |
5 | 2421024040110224011 |
6 | 35234353555505431 |
7 | 2215122246502564 |
oct | 240273520415173 |
9 | 43015285650031 |
10 | 11020303211131 |
11 | 3569758955a45 |
12 | 129b9852b8277 |
13 | 61c296882256 |
14 | 2a1557c2916b |
15 | 1419e3d6a7c1 |
hex | a05dd421a7b |
11020303211131 has 2 divisors, whose sum is σ = 11020303211132. Its totient is φ = 11020303211130.
The previous prime is 11020303211111. The next prime is 11020303211143. The reversal of 11020303211131 is 13111230302011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11020303211131 - 213 = 11020303202939 is a prime.
It is a super-2 number, since 2×110203032111312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11020303211099 and 11020303211108.
It is not a weakly prime, because it can be changed into another prime (11020303211111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510151605565 + 5510151605566.
It is an arithmetic number, because the mean of its divisors is an integer number (5510151605566).
Almost surely, 211020303211131 is an apocalyptic number.
11020303211131 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020303211131 is an equidigital number, since it uses as much as digits as its factorization.
11020303211131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 11020303211131 its reverse (13111230302011), we get a palindrome (24131533513142).
The spelling of 11020303211131 in words is "eleven trillion, twenty billion, three hundred three million, two hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •