Search a number
BaseRepresentation
bin10100011111111001…
…111010000010100000
32002210220220102221102
4110133321322002200
5330034042010422
614040013013532
71406300564144
oct243771720240
962726812842
1022010110112
119375151551
1243231842a8
1320c9c819c3
1410cb253224
1588c479192
hex51fe7a0a0

22010110112 has 96 divisors (see below), whose sum is σ = 47617113600. Its totient is φ = 9975398400.

The previous prime is 22010110099. The next prime is 22010110127. The reversal of 22010110112 is 21101101022.

Adding to 22010110112 its reverse (21101101022), we get a palindrome (43111211134).

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

It is an unprimeable number.

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

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

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

Almost surely, 222010110112 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 8, while the sum is 11.

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