Search a number
-
+
102013322129 is a prime number
BaseRepresentation
bin101111100000001110…
…1111100001110010001
3100202022111001200222222
41133000131330032101
53132410402302004
6114510403310425
710240661634215
oct1370035741621
9322274050888
10102013322129
113a299951894
121793007b415
13980996c804
144d1a5c6945
1529c0d7e7be
hex17c077c391

102013322129 has 2 divisors, whose sum is σ = 102013322130. Its totient is φ = 102013322128.

The previous prime is 102013322119. The next prime is 102013322179. The reversal of 102013322129 is 921223310201.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 101746326529 + 266995600 = 318977^2 + 16340^2 .

It is a cyclic number.

It is not a de Polignac number, because 102013322129 - 28 = 102013321873 is a prime.

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

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

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

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

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

Almost surely, 2102013322129 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1296, while the sum is 26.

The spelling of 102013322129 in words is "one hundred two billion, thirteen million, three hundred twenty-two thousand, one hundred twenty-nine".