Base | Representation |
---|---|
bin | 100000001100010010100… |
… | …110011001001110011111 |
3 | 21211111010102121122001122 |
4 | 200030102212121032133 |
5 | 242221111333242002 |
6 | 4412140244401155 |
7 | 315553610354462 |
oct | 40142246311637 |
9 | 7744112548048 |
10 | 2212220212127 |
11 | 783219701252 |
12 | 2b88b00a61bb |
13 | 1307c452b1a3 |
14 | 791019132d9 |
15 | 3c8291c06a2 |
hex | 2031299939f |
2212220212127 has 2 divisors, whose sum is σ = 2212220212128. Its totient is φ = 2212220212126.
The previous prime is 2212220212073. The next prime is 2212220212129. The reversal of 2212220212127 is 7212120222122.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2212220212127 - 224 = 2212203434911 is a prime.
Together with 2212220212129, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2212220212096 and 2212220212105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2212220212129) 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, 1106110106063 + 1106110106064.
It is an arithmetic number, because the mean of its divisors is an integer number (1106110106064).
Almost surely, 22212220212127 is an apocalyptic number.
2212220212127 is a deficient number, since it is larger than the sum of its proper divisors (1).
2212220212127 is an equidigital number, since it uses as much as digits as its factorization.
2212220212127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1792, while the sum is 26.
Adding to 2212220212127 its reverse (7212120222122), we get a palindrome (9424340434249).
The spelling of 2212220212127 in words is "two trillion, two hundred twelve billion, two hundred twenty million, two hundred twelve thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •