1014162680752 has 60 divisors (see below), whose sum is σ = 2154649876320. Its totient is φ = 462149985024.

The previous prime is 1014162680701. The next prime is 1014162680821. The reversal of 1014162680752 is 2570862614101.

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

It is an unprimeable number.

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, 2160183 + ... + 2587414.

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

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

It is an amenable number.

1014162680752 is an abundant number, since it is smaller than the sum of its proper divisors (1140487195568).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 161280, while the sum is 43.

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