Search a number
-
+
101555310545113 is a prime number
BaseRepresentation
bin10111000101110100110000…
…001101011100100011011001
3111022120121000012111111000011
4113011310300031130203121
5101302340233444420423
6555553510545241521
730251062160510335
oct2705646015344331
9438517005444004
10101555310545113
112a3a4402296777
12b4821240332a1
1344888175ab649
141b114361ca7c5
15bb1a47858b0d
hex5c5d3035c8d9

101555310545113 has 2 divisors, whose sum is σ = 101555310545114. Its totient is φ = 101555310545112.

The previous prime is 101555310545083. The next prime is 101555310545173. The reversal of 101555310545113 is 311545013555101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 63518142409929 + 38037168135184 = 7969827^2 + 6167428^2 .

It is a cyclic number.

It is not a de Polignac number, because 101555310545113 - 25 = 101555310545081 is a prime.

It is not a weakly prime, because it can be changed into another prime (101555310545173) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50777655272556 + 50777655272557.

It is an arithmetic number, because the mean of its divisors is an integer number (50777655272557).

Almost surely, 2101555310545113 is an apocalyptic number.

It is an amenable number.

101555310545113 is a deficient number, since it is larger than the sum of its proper divisors (1).

101555310545113 is an equidigital number, since it uses as much as digits as its factorization.

101555310545113 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 112500, while the sum is 40.

The spelling of 101555310545113 in words is "one hundred one trillion, five hundred fifty-five billion, three hundred ten million, five hundred forty-five thousand, one hundred thirteen".