Search a number
-
+
102011111112013 is a prime number
BaseRepresentation
bin10111001100011101010000…
…000010100111110101001101
3111101012011111201200100111221
4113030131100002213311031
5101332322223421041023
61000543131341243341
730326026300426015
oct2714352002476515
9441164451610457
10102011111112013
112a55a73a886964
12b53652a863551
1344bc7b66391bc
141b29515216c45
15bbd822e8885d
hex5cc7500a7d4d

102011111112013 has 2 divisors, whose sum is σ = 102011111112014. Its totient is φ = 102011111112012.

The previous prime is 102011111111999. The next prime is 102011111112017. The reversal of 102011111112013 is 310211111110201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 70271386136809 + 31739724975204 = 8382803^2 + 5633802^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

Almost surely, 2102011111112013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12, while the sum is 16.

Adding to 102011111112013 its reverse (310211111110201), we get a palindrome (412222222222214).

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