Base | Representation |
---|---|
bin | 100000010011101111011… |
… | …111110001111000010011 |
3 | 21212020210000220102222001 |
4 | 200103233133301320103 |
5 | 242334003112211011 |
6 | 4415542221454431 |
7 | 316256102622331 |
oct | 40235737617023 |
9 | 7766700812861 |
10 | 2220221210131 |
11 | 786654aa04a1 |
12 | 2ba363711417 |
13 | 13149b030632 |
14 | 7966039ab51 |
15 | 3cb468167c1 |
hex | 204ef7f1e13 |
2220221210131 has 2 divisors, whose sum is σ = 2220221210132. Its totient is φ = 2220221210130.
The previous prime is 2220221210111. The next prime is 2220221210177. The reversal of 2220221210131 is 1310121220222.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2220221210131 - 217 = 2220221079059 is a prime.
It is a super-2 number, since 2×22202212101312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2220221210099 and 2220221210108.
It is not a weakly prime, because it can be changed into another prime (2220221210111) 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, 1110110605065 + 1110110605066.
It is an arithmetic number, because the mean of its divisors is an integer number (1110110605066).
Almost surely, 22220221210131 is an apocalyptic number.
2220221210131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2220221210131 is an equidigital number, since it uses as much as digits as its factorization.
2220221210131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 2220221210131 its reverse (1310121220222), we get a palindrome (3530342430353).
The spelling of 2220221210131 in words is "two trillion, two hundred twenty billion, two hundred twenty-one million, two hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •