1111143150323 has 2 divisors, whose sum is σ = 1111143150324. Its totient is φ = 1111143150322.

The previous prime is 1111143150289. The next prime is 1111143150329. The reversal of 1111143150323 is 3230513411111.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1111143150323 - 2⁸ = 1111143150067 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1111143150292 and 1111143150301.

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

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

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

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

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

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

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

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

Adding to 1111143150323 its reverse (3230513411111), we get a palindrome (4341656561434).

The spelling of 1111143150323 in words is "one trillion, one hundred eleven billion, one hundred forty-three million, one hundred fifty thousand, three hundred twenty-three".