Search a number
-
+
1102200011131 is a prime number
BaseRepresentation
bin10000000010100000001…
…111010111100101111011
310220100222012202220122111
4100002200033113211323
5121024301200324011
62202202123233151
7142426354341112
oct20024017274573
93810865686574
101102200011131
11395493198a0a
121597446787b7
137cc248119cb
143b4bd748c79
151da0dbc1121
hex100a03d797b

1102200011131 has 2 divisors, whose sum is σ = 1102200011132. Its totient is φ = 1102200011130.

The previous prime is 1102200011117. The next prime is 1102200011197. The reversal of 1102200011131 is 1311100022011.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1102200011131 - 29 = 1102200010619 is a prime.

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

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

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

Almost surely, 21102200011131 is an apocalyptic number.

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

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

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

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

Adding to 1102200011131 its reverse (1311100022011), we get a palindrome (2413300033142).

The spelling of 1102200011131 in words is "one trillion, one hundred two billion, two hundred million, eleven thousand, one hundred thirty-one".