1101001100131 has 2 divisors, whose sum is σ = 1101001100132. Its totient is φ = 1101001100130.

The previous prime is 1101001100119. The next prime is 1101001100141. The reversal of 1101001100131 is 1310011001011.

It is an a-pointer prime, because the next prime (1101001100141) can be obtained adding 1101001100131 to its sum of digits (10).

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-1101001100131 is a prime.

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

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

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

Almost surely, 2^{1101001100131} is an apocalyptic number.

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

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

1101001100131 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 1101001100131 its reverse (1310011001011), we get a palindrome (2411012101142).

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