Base | Representation |
---|---|
bin | 110000001111111010110000… |
… | …010011110110011111011111 |
3 | 1000211100010120200011012221021 |
4 | 300033322300103312133133 |
5 | 210303141312212021002 |
6 | 2031151215154545011 |
7 | 62460644412203443 |
oct | 6017726023663737 |
9 | 1024303520135837 |
10 | 212200112220127 |
11 | 61682620336a59 |
12 | 1b971978298167 |
13 | 91535002cc675 |
14 | 3a5877c576823 |
15 | 197ec2a1ee737 |
hex | c0feb04f67df |
212200112220127 has 2 divisors, whose sum is σ = 212200112220128. Its totient is φ = 212200112220126.
The previous prime is 212200112220097. The next prime is 212200112220167. The reversal of 212200112220127 is 721022211002212.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212200112220127 is a prime.
It is a super-2 number, since 2×2122001122201272 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212200112220167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106100056110063 + 106100056110064.
It is an arithmetic number, because the mean of its divisors is an integer number (106100056110064).
Almost surely, 2212200112220127 is an apocalyptic number.
212200112220127 is a deficient number, since it is larger than the sum of its proper divisors (1).
212200112220127 is an equidigital number, since it uses as much as digits as its factorization.
212200112220127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 896, while the sum is 25.
Adding to 212200112220127 its reverse (721022211002212), we get a palindrome (933222323222339).
The spelling of 212200112220127 in words is "two hundred twelve trillion, two hundred billion, one hundred twelve million, two hundred twenty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •