1101431410367 has 2 divisors, whose sum is σ = 1101431410368. Its totient is φ = 1101431410366.

The previous prime is 1101431410361. The next prime is 1101431410403. The reversal of 1101431410367 is 7630141341011.

It is a weak prime.

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 6048, while the sum is 32.

Adding to 1101431410367 its reverse (7630141341011), we get a palindrome (8731572751378).

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