Search a number
-
+
11001010102931 is a prime number
BaseRepresentation
bin1010000000010101111101…
…0011001010001010010011
31102221200112022100020001002
42200011133103022022103
52420220032041243211
635221443321332215
72213540200002662
oct240053723121223
942850468306032
1011001010102931
113561558453222
1212980a003706b
1361a51078a8b4
142a0647792dd9
151412651d403b
hexa015f4ca293

11001010102931 has 2 divisors, whose sum is σ = 11001010102932. Its totient is φ = 11001010102930.

The previous prime is 11001010102913. The next prime is 11001010102939. The reversal of 11001010102931 is 13920101010011.

It is a happy number.

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

It is a strong prime.

It is a cyclic number.

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

It is a super-2 number, since 2×110010101029312 (a number of 27 digits) contains 22 as substring.

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

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

Almost surely, 211001010102931 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 54, while the sum is 20.

Adding to 11001010102931 its reverse (13920101010011), we get a palindrome (24921111112942).

The spelling of 11001010102931 in words is "eleven trillion, one billion, ten million, one hundred two thousand, nine hundred thirty-one".