Search a number
-
+
102210012112141 is a prime number
BaseRepresentation
bin10111001111010110011111…
…011101101110010100001101
3111101220011220111000001121101
4113033112133131232110031
5101344102101100042031
61001214344212103101
730346300245143533
oct2717263735562415
9441804814001541
10102210012112141
112a6270282561aa
12b568b9a304a91
13450549406799b
141b34dc337a153
15bc3ab4bc3361
hex5cf59f76e50d

102210012112141 has 2 divisors, whose sum is σ = 102210012112142. Its totient is φ = 102210012112140.

The previous prime is 102210012111997. The next prime is 102210012112171. The reversal of 102210012112141 is 141211210012201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 71175865223241 + 31034146888900 = 8436579^2 + 5570830^2 .

It is a cyclic number.

It is not a de Polignac number, because 102210012112141 - 29 = 102210012111629 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (102210012112171) 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, 51105006056070 + 51105006056071.

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

Almost surely, 2102210012112141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 64, while the sum is 19.

Adding to 102210012112141 its reverse (141211210012201), we get a palindrome (243421222124342).

The spelling of 102210012112141 in words is "one hundred two trillion, two hundred ten billion, twelve million, one hundred twelve thousand, one hundred forty-one".