10641170026230 has 32 divisors (see below), whose sum is σ = 25540175778048. Its totient is φ = 2837493372000.

The previous prime is 10641170026183. The next prime is 10641170026237. The reversal of 10641170026230 is 3262007114601.

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

It is a Curzon number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8927946 + ... + 10049405.

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

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

10641170026230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

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

The sum of its prime factors is 18996052.

The product of its (nonzero) digits is 12096, while the sum is 33.

The spelling of 10641170026230 in words is "ten trillion, six hundred forty-one billion, one hundred seventy million, twenty-six thousand, two hundred thirty".