Base | Representation |
---|---|
bin | 1100010110100000011… |
… | …1001001100011100101 |
3 | 202021201120221002100101 |
4 | 3011220013021203211 |
5 | 11434041211231432 |
6 | 241252224344101 |
7 | 21221342051563 |
oct | 3055007114345 |
9 | 667646832311 |
10 | 212200102117 |
11 | 81aa2475523 |
12 | 35161475031 |
13 | 17019a75603 |
14 | a3b050aa33 |
15 | 57be56e4e7 |
hex | 31681c98e5 |
212200102117 has 2 divisors, whose sum is σ = 212200102118. Its totient is φ = 212200102116.
The previous prime is 212200102111. The next prime is 212200102157. The reversal of 212200102117 is 711201002212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 113650568641 + 98549533476 = 337121^2 + 313926^2 .
It is a cyclic number.
It is not a de Polignac number, because 212200102117 - 235 = 177840363749 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212200102094 and 212200102103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212200102111) 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, 106100051058 + 106100051059.
It is an arithmetic number, because the mean of its divisors is an integer number (106100051059).
Almost surely, 2212200102117 is an apocalyptic number.
It is an amenable number.
212200102117 is a deficient number, since it is larger than the sum of its proper divisors (1).
212200102117 is an equidigital number, since it uses as much as digits as its factorization.
212200102117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 19.
Adding to 212200102117 its reverse (711201002212), we get a palindrome (923401104329).
The spelling of 212200102117 in words is "two hundred twelve billion, two hundred million, one hundred two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •