10692561313956 has 48 divisors (see below), whose sum is σ = 26037577367424. Its totient is φ = 3408762145536.

The previous prime is 10692561313939. The next prime is 10692561313999. The reversal of 10692561313956 is 65931316529601.

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

It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors.

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

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 15 ways as a sum of consecutive naturals, for example, 564555 + ... + 4658738.

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

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

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 7873200, while the sum is 57.

The spelling of 10692561313956 in words is "ten trillion, six hundred ninety-two billion, five hundred sixty-one million, three hundred thirteen thousand, nine hundred fifty-six".