Search a number
-
+
11111005105073 is a prime number
BaseRepresentation
bin1010000110101111101110…
…0000110010101110110001
31110100012110001100021122022
42201223323200302232301
52424020314301330243
635344154132121225
72224513031046266
oct241537340625661
943305401307568
1011111005105073
1135a417279a375
1212b5479166215
136279bcc27993
142a5ac003526d
15144051b40b68
hexa1afb832bb1

11111005105073 has 2 divisors, whose sum is σ = 11111005105074. Its totient is φ = 11111005105072.

The previous prime is 11111005105007. The next prime is 11111005105103. The reversal of 11111005105073 is 37050150011111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5744707763344 + 5366297341729 = 2396812^2 + 2316527^2 .

It is an emirp because it is prime and its reverse (37050150011111) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11111005105073 - 28 = 11111005104817 is a prime.

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

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

Almost surely, 211111005105073 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 525, while the sum is 26.

Adding to 11111005105073 its reverse (37050150011111), we get a palindrome (48161155116184).

The spelling of 11111005105073 in words is "eleven trillion, one hundred eleven billion, five million, one hundred five thousand, seventy-three".