10692511017053 has 2 divisors, whose sum is σ = 10692511017054. Its totient is φ = 10692511017052.

The previous prime is 10692511017017. The next prime is 10692511017101. The reversal of 10692511017053 is 35071011529601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7258616649124 + 3433894367929 = 2694182^2 + 1853077^2 .

It is a cyclic number.

It is not a de Polignac number, because 10692511017053 - 2⁶ = 10692511016989 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 10692511017053.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10692511010053) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5346255508526 + 5346255508527.

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

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

It is an amenable number.

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

10692511017053 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 56700, while the sum is 41.

The spelling of 10692511017053 in words is "ten trillion, six hundred ninety-two billion, five hundred eleven million, seventeen thousand, fifty-three".