Search a number
-
+
11090034513113 is a prime number
BaseRepresentation
bin1010000101100001100110…
…0100010101010011011001
31110021012022120110211112012
42201120121210111103121
52423144342313404423
635330405211355305
72223141252003233
oct241303144252331
943235276424465
1011090034513113
113596291403236
1212b13a6152b35
13625a2a43b59a
142a4a90c99253
15143725aa2078
hexa16199154d9

11090034513113 has 2 divisors, whose sum is σ = 11090034513114. Its totient is φ = 11090034513112.

The previous prime is 11090034513071. The next prime is 11090034513197. The reversal of 11090034513113 is 31131543009011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10602890539264 + 487143973849 = 3256208^2 + 697957^2 .

It is a cyclic number.

It is not a de Polignac number, because 11090034513113 - 28 = 11090034512857 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 11090034513113.

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

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

Almost surely, 211090034513113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4860, while the sum is 32.

The spelling of 11090034513113 in words is "eleven trillion, ninety billion, thirty-four million, five hundred thirteen thousand, one hundred thirteen".