10690725214138 has 32 divisors (see below), whose sum is σ = 16369549516800. Its totient is φ = 5235309241344.

The previous prime is 10690725214133. The next prime is 10690725214171. The reversal of 10690725214138 is 83141252709601.

It is a happy number.

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

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

It is not an unprimeable number, because it can be changed into a prime (10690725214133) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 136991706 + ... + 137069722.

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

It is a 1-persistent number, because it is pandigital, but 2⋅10690725214138 = 21381450428276 is not.

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

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

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

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

The sum of its prime factors is 85054.

The product of its (nonzero) digits is 725760, while the sum is 49.

The spelling of 10690725214138 in words is "ten trillion, six hundred ninety billion, seven hundred twenty-five million, two hundred fourteen thousand, one hundred thirty-eight".