Search a number
-
+
102011022123013 is a prime number
BaseRepresentation
bin10111001100011101001010…
…101111001010000000000101
3111101012011021112020020120001
4113030131022233022000011
5101332322033130414023
61000543114442041301
730326024140143613
oct2714351257120005
9441164245206501
10102011022123013
112a55a6a4626133
12b536504aa9231
1344bc7a107c4a3
141b295074906b3
15bbd81a25b6ad
hex5cc74abca005

102011022123013 has 2 divisors, whose sum is σ = 102011022123014. Its totient is φ = 102011022123012.

The previous prime is 102011022122921. The next prime is 102011022123041. The reversal of 102011022123013 is 310321220110201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 60963333641604 + 41047688481409 = 7807902^2 + 6406847^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

Almost surely, 2102011022123013 is an apocalyptic number.

It is an amenable number.

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

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

102011022123013 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 19.

Adding to 102011022123013 its reverse (310321220110201), we get a palindrome (412332242233214).

The spelling of 102011022123013 in words is "one hundred two trillion, eleven billion, twenty-two million, one hundred twenty-three thousand, thirteen".