Base | Representation |
---|---|
bin | 100000001100010010101… |
… | …010100111101111000011 |
3 | 21211111010111200220221211 |
4 | 200030102222213233003 |
5 | 242221112124221011 |
6 | 4412140324230551 |
7 | 315553622651014 |
oct | 40142252475703 |
9 | 7744114626854 |
10 | 2212221320131 |
11 | 78321a298759 |
12 | 2b88b053b457 |
13 | 1307c4828604 |
14 | 79101b2100b |
15 | 3c82933db21 |
hex | 20312aa7bc3 |
2212221320131 has 2 divisors, whose sum is σ = 2212221320132. Its totient is φ = 2212221320130.
The previous prime is 2212221320117. The next prime is 2212221320137. The reversal of 2212221320131 is 1310231222122.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2212221320131 - 27 = 2212221320003 is a prime.
It is a super-2 number, since 2×22122213201312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2212221320137) 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, 1106110660065 + 1106110660066.
It is an arithmetic number, because the mean of its divisors is an integer number (1106110660066).
Almost surely, 22212221320131 is an apocalyptic number.
2212221320131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2212221320131 is an equidigital number, since it uses as much as digits as its factorization.
2212221320131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 2212221320131 its reverse (1310231222122), we get a palindrome (3522452542253).
It can be divided in two parts, 2212221 and 320131, that added together give a palindrome (2532352).
The spelling of 2212221320131 in words is "two trillion, two hundred twelve billion, two hundred twenty-one million, three hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •