10690189428567 has 32 divisors (see below), whose sum is σ = 15607045601280. Its totient is φ = 6454877735520.

The previous prime is 10690189428559. The next prime is 10690189428571. The reversal of 10690189428567 is 76582498109601.

It is not a de Polignac number, because 10690189428567 - 2³ = 10690189428559 is a prime.

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

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

It is a congruent number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 54806628 + ... + 55001334.

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

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

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

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

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

The sum of its prime factors is 200883.

The product of its (nonzero) digits is 52254720, while the sum is 66.

The spelling of 10690189428567 in words is "ten trillion, six hundred ninety billion, one hundred eighty-nine million, four hundred twenty-eight thousand, five hundred sixty-seven".