Search a number
-
+
11012100101113 is a prime number
BaseRepresentation
bin1010000000111111010001…
…0100001001001111111001
31102222202011012010111120111
42200033310110021033321
52420410240111213423
635230520002424321
72214412051303126
oct240176424111771
942882135114514
1011012100101113
113566229470a81
12129a2760620a1
1361b58a2363b7
142a0dba5ad74d
151416b3aee60d
hexa03f45093f9

11012100101113 has 2 divisors, whose sum is σ = 11012100101114. Its totient is φ = 11012100101112.

The previous prime is 11012100101087. The next prime is 11012100101129. The reversal of 11012100101113 is 31110100121011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10900912532409 + 111187568704 = 3301653^2 + 333448^2 .

It is a cyclic number.

It is not a de Polignac number, because 11012100101113 - 213 = 11012100092921 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 11012100101093 and 11012100101102.

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

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

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

Almost surely, 211012100101113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 13.

Adding to 11012100101113 its reverse (31110100121011), we get a palindrome (42122200222124).

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