Base | Representation |
---|---|
bin | 1011000000111010000000… |
… | …1011001101110011101111 |
3 | 1120212201112200000022200102 |
4 | 2300032200023031303233 |
5 | 3041403142211232002 |
6 | 41431203224421315 |
7 | 2356635022304051 |
oct | 260164013156357 |
9 | 46781480008612 |
10 | 12110200102127 |
11 | 39499a8277676 |
12 | 143705561783b |
13 | 69acaa4ab3ca |
14 | 2dc1cb5ad8d1 |
15 | 160032892a02 |
hex | b03a02cdcef |
12110200102127 has 2 divisors, whose sum is σ = 12110200102128. Its totient is φ = 12110200102126.
The previous prime is 12110200102093. The next prime is 12110200102139. The reversal of 12110200102127 is 72120100201121.
It is a happy number.
12110200102127 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12110200102127 - 214 = 12110200085743 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12110200102099 and 12110200102108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12110200102177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6055100051063 + 6055100051064.
It is an arithmetic number, because the mean of its divisors is an integer number (6055100051064).
Almost surely, 212110200102127 is an apocalyptic number.
12110200102127 is a deficient number, since it is larger than the sum of its proper divisors (1).
12110200102127 is an equidigital number, since it uses as much as digits as its factorization.
12110200102127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 12110200102127 its reverse (72120100201121), we get a palindrome (84230300303248).
The spelling of 12110200102127 in words is "twelve trillion, one hundred ten billion, two hundred million, one hundred two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •