Search a number
-
+
1111131521111 is a prime number
BaseRepresentation
bin10000001010110100100…
…110011000000001010111
310221020000122222122000102
4100022310212120001113
5121201044132133421
62210240300404315
7143163606044603
oct20126446300127
93836018878012
101111131521111
1139925685a617
1215b41784669b
1380a19031861
143bac9a12503
151dd82d6e60b
hex102b4998057

1111131521111 has 2 divisors, whose sum is σ = 1111131521112. Its totient is φ = 1111131521110.

The previous prime is 1111131521107. The next prime is 1111131521141. The reversal of 1111131521111 is 1111251311111.

It is a m-pointer prime, because the next prime (1111131521141) can be obtained adding 1111131521111 to its product of digits (30).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1111131521111 - 22 = 1111131521107 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 21111131521111 is an apocalyptic number.

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

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

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

The product of its digits is 30, while the sum is 20.

Adding to 1111131521111 its reverse (1111251311111), we get a palindrome (2222382832222).

The spelling of 1111131521111 in words is "one trillion, one hundred eleven billion, one hundred thirty-one million, five hundred twenty-one thousand, one hundred eleven".