Search a number
-
+
11102000111113 is a prime number
BaseRepresentation
bin1010000110001110001011…
…0001011101111000001001
31110022100012110212012012111
42201203202301131320021
52423343344012023423
635340104411542321
72224043624625502
oct241434261357011
943270173765174
1011102000111113
1135a03716a80aa
1212b378545a9a1
13626bb64195a2
142a54a80bdba9
15143bc62c960d
hexa18e2c5de09

11102000111113 has 2 divisors, whose sum is σ = 11102000111114. Its totient is φ = 11102000111112.

The previous prime is 11102000111029. The next prime is 11102000111143. The reversal of 11102000111113 is 31111100020111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9853120105024 + 1248880006089 = 3138968^2 + 1117533^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 11102000111113 - 221 = 11101998013961 is a prime.

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

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

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

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

Almost surely, 211102000111113 is an apocalyptic number.

It is an amenable number.

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

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

11102000111113 is an evil number, because the sum of its binary digits is even.

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

Adding to 11102000111113 its reverse (31111100020111), we get a palindrome (42213100131224).

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