Base | Representation |
---|---|
bin | 100000000010111110101… |
… | …010001111111111010011 |
3 | 21210112022122012221100201 |
4 | 200002332222033333103 |
5 | 242040122313032011 |
6 | 4403404204200031 |
7 | 315051054106264 |
oct | 40027652177723 |
9 | 7715278187321 |
10 | 2202222002131 |
11 | 779a589aa088 |
12 | 2b697b839017 |
13 | 12c8900196b8 |
14 | 78833ad896b |
15 | 3c441567cc1 |
hex | 200bea8ffd3 |
2202222002131 has 2 divisors, whose sum is σ = 2202222002132. Its totient is φ = 2202222002130.
The previous prime is 2202222002107. The next prime is 2202222002153. The reversal of 2202222002131 is 1312002222022.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2202222002131 - 27 = 2202222002003 is a prime.
It is a super-2 number, since 2×22022220021312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2202222002099 and 2202222002108.
It is not a weakly prime, because it can be changed into another prime (2202222002831) 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, 1101111001065 + 1101111001066.
It is an arithmetic number, because the mean of its divisors is an integer number (1101111001066).
Almost surely, 22202222002131 is an apocalyptic number.
2202222002131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2202222002131 is an equidigital number, since it uses as much as digits as its factorization.
2202222002131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 2202222002131 its reverse (1312002222022), we get a palindrome (3514224224153).
The spelling of 2202222002131 in words is "two trillion, two hundred two billion, two hundred twenty-two million, two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •