10695050632 has 16 divisors (see below), whose sum is σ = 22917965760. Its totient is φ = 4583593104.

The previous prime is 10695050599. The next prime is 10695050633. The reversal of 10695050632 is 23605059601.

10695050632 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

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

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 95491468 + ... + 95491579.

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

Almost surely, 2^10695050632 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 48600, while the sum is 37.

The spelling of 10695050632 in words is "ten billion, six hundred ninety-five million, fifty thousand, six hundred thirty-two".