Search a number
-
+
102111020120029 is a prime number
BaseRepresentation
bin10111001101111010010011…
…000101001111011111011101
3111101112201101120002211020011
4113031322103011033133131
5101340441332122320104
61001101053254123221
730336164161120534
oct2715722305173735
9441481346084204
10102111020120029
112a599049913378
12b551972050511
1344c904933a31b
141b302b214d31b
15bc121e1ec904
hex5cde9314f7dd

102111020120029 has 2 divisors, whose sum is σ = 102111020120030. Its totient is φ = 102111020120028.

The previous prime is 102111020120003. The next prime is 102111020120033. The reversal of 102111020120029 is 920021020111201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 99858250268100 + 2252769851929 = 9992910^2 + 1500923^2 .

It is a cyclic number.

It is not a de Polignac number, because 102111020120029 - 221 = 102111018022877 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 102111020119991 and 102111020120009.

It is a congruent number.

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

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

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

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

Almost surely, 2102111020120029 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 144, while the sum is 22.

The spelling of 102111020120029 in words is "one hundred two trillion, one hundred eleven billion, twenty million, one hundred twenty thousand, twenty-nine".