101221010112222 has 1152 divisors, whose sum is σ = 317828090511360. Its totient is φ = 22569100968960.

The previous prime is 101221010112193. The next prime is 101221010112223. The reversal of 101221010112222 is 222211010122101.

101221010112222 is a `hidden beast` number, since 101 + 221 + 0 + 10 + 112 + 222 = 666.

It is a Harshad number since it is a multiple of its sum of digits (18).

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

It is a polite number, since it can be written in 575 ways as a sum of consecutive naturals, for example, 17515312929 + ... + 17515318707.

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

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

It is a practical number, because each smaller number is the sum of distinct divisors of 101221010112222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (158914045255680).

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

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

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

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

The sum of its prime factors is 5958 (or 5942 counting only the distinct ones).

The product of its (nonzero) digits is 64, while the sum is 18.

Adding to 101221010112222 its reverse (222211010122101), we get a palindrome (323432020234323).

The spelling of 101221010112222 in words is "one hundred one trillion, two hundred twenty-one billion, ten million, one hundred twelve thousand, two hundred twenty-two".