1101431410361 has 2 divisors, whose sum is σ = 1101431410362. Its totient is φ = 1101431410360.

The previous prime is 1101431410349. The next prime is 1101431410367. The reversal of 1101431410361 is 1630141341011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1101418765225 + 12645136 = 1049485^2 + 3556^2 .

It is a cyclic number.

It is not a de Polignac number, because 1101431410361 - 2⁶ = 1101431410297 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1101431410361.

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

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 864, while the sum is 26.

Adding to 1101431410361 its reverse (1630141341011), we get a palindrome (2731572751372).

The spelling of 1101431410361 in words is "one trillion, one hundred one billion, four hundred thirty-one million, four hundred ten thousand, three hundred sixty-one".