Base | Representation |
---|---|
bin | 10111001101110001000100… |
… | …011101101101100100011011 |
3 | 111101111202210222201112101001 |
4 | 113031301010131231210123 |
5 | 101340311033431400102 |
6 | 1001052334123405431 |
7 | 30335363500520122 |
oct | 2715610435554433 |
9 | 441452728645331 |
10 | 102101111200027 |
11 | 2a594924558095 |
12 | b54ba67683877 |
13 | 44c812a48c554 |
14 | 1b2da12138ab9 |
15 | bc0d3e331487 |
hex | 5cdc4476d91b |
102101111200027 has 2 divisors, whose sum is σ = 102101111200028. Its totient is φ = 102101111200026.
The previous prime is 102101111199991. The next prime is 102101111200037. The reversal of 102101111200027 is 720002111101201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102101111200027 - 211 = 102101111197979 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102101111199977 and 102101111200013.
It is not a weakly prime, because it can be changed into another prime (102101111200037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51050555600013 + 51050555600014.
It is an arithmetic number, because the mean of its divisors is an integer number (51050555600014).
Almost surely, 2102101111200027 is an apocalyptic number.
102101111200027 is a deficient number, since it is larger than the sum of its proper divisors (1).
102101111200027 is an equidigital number, since it uses as much as digits as its factorization.
102101111200027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 102101111200027 its reverse (720002111101201), we get a palindrome (822103222301228).
The spelling of 102101111200027 in words is "one hundred two trillion, one hundred one billion, one hundred eleven million, two hundred thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •