Base | Representation |
---|---|
bin | 10111001100011101001010… |
… | …100111000110101000111101 |
3 | 111101012011021101020222220211 |
4 | 113030131022213012220331 |
5 | 101332322032110341333 |
6 | 1000543114324512421 |
7 | 30326024113202413 |
oct | 2714351247065075 |
9 | 441164241228824 |
10 | 102011020012093 |
11 | 2a55a6a3414175 |
12 | b53650424b711 |
13 | 44bc7a07c071a |
14 | 1b295070a12b3 |
15 | bbd819e90ecd |
hex | 5cc74a9c6a3d |
102011020012093 has 2 divisors, whose sum is σ = 102011020012094. Its totient is φ = 102011020012092.
The previous prime is 102011020012081. The next prime is 102011020012127. The reversal of 102011020012093 is 390210020110201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 58952252173369 + 43058767838724 = 7678037^2 + 6561918^2 .
It is an emirp because it is prime and its reverse (390210020110201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102011020012093 - 221 = 102011017914941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102011020012063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51005510006046 + 51005510006047.
It is an arithmetic number, because the mean of its divisors is an integer number (51005510006047).
Almost surely, 2102011020012093 is an apocalyptic number.
It is an amenable number.
102011020012093 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011020012093 is an equidigital number, since it uses as much as digits as its factorization.
102011020012093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 102011020012093 its reverse (390210020110201), we get a palindrome (492221040122294).
The spelling of 102011020012093 in words is "one hundred two trillion, eleven billion, twenty million, twelve thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •