1311463052141 has 12 divisors (see below), whose sum is σ = 1441736642556. Its totient is φ = 1192064512320.

The previous prime is 1311463052131. The next prime is 1311463052171. The reversal of 1311463052141 is 1412503641131.

It can be written as a sum of positive squares in 2 ways, for example, as 71513991241 + 1239949060900 = 267421^2 + 1113530^2 .

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

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1311463052131) 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 in 11 ways as a sum of consecutive naturals, for example, 39371 + ... + 1620023.

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

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

1311463052141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

1311463052141 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1587532 (or 1587521 counting only the distinct ones).

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

Adding to 1311463052141 its reverse (1412503641131), we get a palindrome (2723966693272).

The spelling of 1311463052141 in words is "one trillion, three hundred eleven billion, four hundred sixty-three million, fifty-two thousand, one hundred forty-one".