Search a number
-
+
11021112032131 is a prime number
BaseRepresentation
bin1010000001100000110101…
…1101111011101110000011
31110000121102020200000212101
42200120031131323232003
52421032214140012011
635235010131411231
72215151300405365
oct240301535735603
943017366600771
1011021112032131
11356a033471153
12129bb70153b17
1361c395303166
142a15d340cd35
15141a3ed862c1
hexa060d77bb83

11021112032131 has 2 divisors, whose sum is σ = 11021112032132. Its totient is φ = 11021112032130.

The previous prime is 11021112032093. The next prime is 11021112032159. The reversal of 11021112032131 is 13123021112011.

11021112032131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11021112032131 - 211 = 11021112030083 is a prime.

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

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

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

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

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

Almost surely, 211021112032131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 72, while the sum is 19.

Adding to 11021112032131 its reverse (13123021112011), we get a palindrome (24144133144142).

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