10492660934351 has 2 divisors, whose sum is σ = 10492660934352. Its totient is φ = 10492660934350.

The previous prime is 10492660934347. The next prime is 10492660934449. The reversal of 10492660934351 is 15343906629401.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10492660934351 - 2² = 10492660934347 is a prime.

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

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10492660934051) 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 as a sum of consecutive naturals, namely, 5246330467175 + 5246330467176.

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

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

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

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

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

The product of its (nonzero) digits is 4199040, while the sum is 53.

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