Base | Representation |
---|---|
bin | 100000000010110010001… |
… | …001100101010101100111 |
3 | 21210111210000021102112201 |
4 | 200002302021211111213 |
5 | 242034210100042411 |
6 | 4403331305355331 |
7 | 315042625061341 |
oct | 40026211452547 |
9 | 7714700242481 |
10 | 2202012112231 |
11 | 779960481758 |
12 | 2b6921498b47 |
13 | 12c8586ab9a9 |
14 | 78813ca0291 |
15 | 3c42ce083c1 |
hex | 200b2265567 |
2202012112231 has 2 divisors, whose sum is σ = 2202012112232. Its totient is φ = 2202012112230.
The previous prime is 2202012112193. The next prime is 2202012112241. The reversal of 2202012112231 is 1322112102022.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2202012112231 is a prime.
It is a super-2 number, since 2×22020121122312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2202012112199 and 2202012112208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2202012112241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1101006056115 + 1101006056116.
It is an arithmetic number, because the mean of its divisors is an integer number (1101006056116).
Almost surely, 22202012112231 is an apocalyptic number.
2202012112231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2202012112231 is an equidigital number, since it uses as much as digits as its factorization.
2202012112231 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 2202012112231 its reverse (1322112102022), we get a palindrome (3524124214253).
The spelling of 2202012112231 in words is "two trillion, two hundred two billion, twelve million, one hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •