Base | Representation |
---|---|
bin | 100000000001111100011… |
… | …101010101101000101011 |
3 | 21210102110020021111110101 |
4 | 200001330131111220223 |
5 | 242030333444234011 |
6 | 4403102050330231 |
7 | 315011406346252 |
oct | 40017435255053 |
9 | 7712406244411 |
10 | 2201111321131 |
11 | 779538a59aa8 |
12 | 2b670b889977 |
13 | 12c743b991c8 |
14 | 7876a3b9799 |
15 | 3c3c8cc22c1 |
hex | 2007c755a2b |
2201111321131 has 2 divisors, whose sum is σ = 2201111321132. Its totient is φ = 2201111321130.
The previous prime is 2201111321077. The next prime is 2201111321141. The reversal of 2201111321131 is 1311231111022.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2201111321131 is a prime.
It is a super-2 number, since 2×22011113211312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2201111321099 and 2201111321108.
It is not a weakly prime, because it can be changed into another prime (2201111321141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100555660565 + 1100555660566.
It is an arithmetic number, because the mean of its divisors is an integer number (1100555660566).
Almost surely, 22201111321131 is an apocalyptic number.
2201111321131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2201111321131 is an equidigital number, since it uses as much as digits as its factorization.
2201111321131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 2201111321131 its reverse (1311231111022), we get a palindrome (3512342432153).
The spelling of 2201111321131 in words is "two trillion, two hundred one billion, one hundred eleven million, three hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •