Base | Representation |
---|---|
bin | 100000001100001110000… |
… | …100011100000110010011 |
3 | 21211110221010120220221121 |
4 | 200030032010130012103 |
5 | 242220432403432011 |
6 | 4412124531303111 |
7 | 315551665320133 |
oct | 40141604340623 |
9 | 7743833526847 |
10 | 2212144202131 |
11 | 78318a805876 |
12 | 2b888a74aa97 |
13 | 1307b1866c66 |
14 | 790d57a8ac3 |
15 | 3c8226a8e71 |
hex | 2030e11c193 |
2212144202131 has 2 divisors, whose sum is σ = 2212144202132. Its totient is φ = 2212144202130.
The previous prime is 2212144202113. The next prime is 2212144202189. The reversal of 2212144202131 is 1312024412122.
Together with previous prime (2212144202113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2212144202131 - 213 = 2212144193939 is a prime.
It is a super-2 number, since 2×22121442021312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2212144202096 and 2212144202105.
It is not a weakly prime, because it can be changed into another prime (2212144202831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1106072101065 + 1106072101066.
It is an arithmetic number, because the mean of its divisors is an integer number (1106072101066).
Almost surely, 22212144202131 is an apocalyptic number.
2212144202131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2212144202131 is an equidigital number, since it uses as much as digits as its factorization.
2212144202131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 2212144202131 its reverse (1312024412122), we get a palindrome (3524168614253).
The spelling of 2212144202131 in words is "two trillion, two hundred twelve billion, one hundred forty-four million, two hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •