Search a number
-
+
102020211212113 is a prime number
BaseRepresentation
bin10111001100100101101110…
…011100101111111101010001
3111101020000222221010100001101
4113030211232130233331101
5101332444343032241423
61000551234340104401
730326500640130055
oct2714455634577521
9441200887110041
10102020211212113
112a56358a627847
12b53824a395101
1344c0606a6670c
141b29b39a47c65
15bbdba6d397ad
hex5cc96e72ff51

102020211212113 has 2 divisors, whose sum is σ = 102020211212114. Its totient is φ = 102020211212112.

The previous prime is 102020211211981. The next prime is 102020211212131. The reversal of 102020211212113 is 311212112020201.

Together with next prime (102020211212131) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 57065439063889 + 44954772148224 = 7554167^2 + 6704832^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-102020211212113 is a prime.

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

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

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

Almost surely, 2102020211212113 is an apocalyptic number.

It is an amenable number.

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

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

102020211212113 is an evil number, because the sum of its binary digits is even.

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

Adding to 102020211212113 its reverse (311212112020201), we get a palindrome (413232323232314).

The spelling of 102020211212113 in words is "one hundred two trillion, twenty billion, two hundred eleven million, two hundred twelve thousand, one hundred thirteen".