Base | Representation |
---|---|
bin | 1011000110001000111011… |
… | …0000100010101001111011 |
3 | 1121012022121002200121021202 |
4 | 2301202032300202221323 |
5 | 3044341302131211141 |
6 | 41540352150524415 |
7 | 2366266622515241 |
oct | 261421660425173 |
9 | 47168532617252 |
10 | 12200102210171 |
11 | 3984041707017 |
12 | 145056566670b |
13 | 6a6606c47545 |
14 | 3026b94a8791 |
15 | 16254533449b |
hex | b188ec22a7b |
12200102210171 has 2 divisors, whose sum is σ = 12200102210172. Its totient is φ = 12200102210170.
The previous prime is 12200102210117. The next prime is 12200102210209. The reversal of 12200102210171 is 17101220100221.
It is a happy number.
Together with previous prime (12200102210117) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (17101220100221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12200102210171 - 222 = 12200098015867 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (12200102212171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100051105085 + 6100051105086.
It is an arithmetic number, because the mean of its divisors is an integer number (6100051105086).
Almost surely, 212200102210171 is an apocalyptic number.
12200102210171 is a deficient number, since it is larger than the sum of its proper divisors (1).
12200102210171 is an equidigital number, since it uses as much as digits as its factorization.
12200102210171 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 20.
Adding to 12200102210171 its reverse (17101220100221), we get a palindrome (29301322310392).
The spelling of 12200102210171 in words is "twelve trillion, two hundred billion, one hundred two million, two hundred ten thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •