10642621403661 has 32 divisors (see below), whose sum is σ = 15293790852480. Its totient is φ = 6544130740224.

The previous prime is 10642621403657. The next prime is 10642621403683. The reversal of 10642621403661 is 16630412624601.

It is not a de Polignac number, because 10642621403661 - 2² = 10642621403657 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10642621403611) 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 in 31 ways as a sum of consecutive naturals, for example, 434859721 + ... + 434884193.

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 32845.

The product of its (nonzero) digits is 248832, while the sum is 42.

The spelling of 10642621403661 in words is "ten trillion, six hundred forty-two billion, six hundred twenty-one million, four hundred three thousand, six hundred sixty-one".