1014062637131 has 2 divisors, whose sum is σ = 1014062637132. Its totient is φ = 1014062637130.

The previous prime is 1014062637113. The next prime is 1014062637143. The reversal of 1014062637131 is 1317362604101.

Together with previous prime (1014062637113) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is an emirp because it is prime and its reverse (1317362604101) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1014062637131 - 2²² = 1014058442827 is a prime.

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

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 18144, while the sum is 35.

The spelling of 1014062637131 in words is "one trillion, fourteen billion, sixty-two million, six hundred thirty-seven thousand, one hundred thirty-one".