Search a number
-
+
11102000103101 is a prime number
BaseRepresentation
bin1010000110001110001011…
…0001011011111010111101
31110022100012110211210012202
42201203202301123322331
52423343344011244401
635340104411441245
72224043624563235
oct241434261337275
943270173753182
1011102000103101
1135a03716a2086
1212b3785456225
13626bb6415a4b
142a54a80bacc5
15143bc62c706b
hexa18e2c5bebd

11102000103101 has 2 divisors, whose sum is σ = 11102000103102. Its totient is φ = 11102000103100.

The previous prime is 11102000103049. The next prime is 11102000103109. The reversal of 11102000103101 is 10130100020111.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8238794308900 + 2863205794201 = 2870330^2 + 1692101^2 .

It is a cyclic number.

It is not a de Polignac number, because 11102000103101 - 26 = 11102000103037 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 211102000103101 is an apocalyptic number.

It is an amenable number.

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

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

11102000103101 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 11.

Adding to 11102000103101 its reverse (10130100020111), we get a palindrome (21232100123212).

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