Search a number
-
+
1111101021137 is a prime number
BaseRepresentation
bin10000001010110010110…
…010000001101111010001
310221012221112121001220202
4100022302302001233101
5121201013330134022
62210233250544545
7143163055564442
oct20126262015721
93835845531822
101111101021137
11399240618528
1215b409598155
1380a12913133
143bac59532c9
151dd80347592
hex102b2c81bd1

1111101021137 has 2 divisors, whose sum is σ = 1111101021138. Its totient is φ = 1111101021136.

The previous prime is 1111101021119. The next prime is 1111101021139. The reversal of 1111101021137 is 7311201011111.

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., 1002569648656 + 108531372481 = 1001284^2 + 329441^2 .

It is a cyclic number.

It is not a de Polignac number, because 1111101021137 - 212 = 1111101017041 is a prime.

Together with 1111101021139, it forms a pair of twin primes.

It is a Chen prime.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 21111101021137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 42, while the sum is 20.

Adding to 1111101021137 its reverse (7311201011111), we get a palindrome (8422302032248).

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