1036713215981 has 2 divisors, whose sum is σ = 1036713215982. Its totient is φ = 1036713215980.

The previous prime is 1036713215971. The next prime is 1036713216037. The reversal of 1036713215981 is 1895123176301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1001532586756 + 35180629225 = 1000766^2 + 187565^2 .

It is a cyclic number.

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

It is a super-3 number, since 3×1036713215981³ (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

1036713215981 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 272160, while the sum is 47.

The spelling of 1036713215981 in words is "one trillion, thirty-six billion, seven hundred thirteen million, two hundred fifteen thousand, nine hundred eighty-one".