Search a number
-
+
1110000101131 is a prime number
BaseRepresentation
bin10000001001110001001…
…010010110011100001011
310221010002211000112120201
4100021301022112130023
5121141240011214011
62205532122233031
7143123560120225
oct20116112263413
93833084015521
101110000101131
11398826134a89
1215b160955777
13808987cc78c
143ba1d655415
151dd1887dcc1
hex1027129670b

1110000101131 has 2 divisors, whose sum is σ = 1110000101132. Its totient is φ = 1110000101130.

The previous prime is 1110000101113. The next prime is 1110000101143. The reversal of 1110000101131 is 1311010000111.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1110000101131 - 211 = 1110000099083 is a prime.

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

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

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

Almost surely, 21110000101131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 1110000101131 its reverse (1311010000111), we get a palindrome (2421010101242).

The spelling of 1110000101131 in words is "one trillion, one hundred ten billion, one hundred one thousand, one hundred thirty-one".