Search a number
-
+
2111550056131 is a prime number
BaseRepresentation
bin11110101110100010001…
…100001110011011000011
321110212021112221211121111
4132232202030032123003
5234043423303244011
64254011021504151
7305361115223425
oct36564214163303
97425245854544
102111550056131
11744559a6001a
122a1295a12057
1312416cc2b349
14742b1886815
1539dd620b121
hex1eba230e6c3

2111550056131 has 2 divisors, whose sum is σ = 2111550056132. Its totient is φ = 2111550056130.

The previous prime is 2111550056113. The next prime is 2111550056153. The reversal of 2111550056131 is 1316500551112.

It is a happy number.

Together with previous prime (2111550056113) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 2111550056131 - 27 = 2111550056003 is a prime.

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

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

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

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

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

Almost surely, 22111550056131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4500, while the sum is 31.

The spelling of 2111550056131 in words is "two trillion, one hundred eleven billion, five hundred fifty million, fifty-six thousand, one hundred thirty-one".