Search a number
BaseRepresentation
bin100110010110…
…1111011111110
31101211202020122
41030231323332
520122023402
61555014542
7332640644
oct114557376
941752218
1020111102
1110396850
12689a452
134221b7b
142957194
151b73ca2
hex132defe

20111102 has 16 divisors (see below), whose sum is σ = 34845552. Its totient is φ = 8603520.

The previous prime is 20111093. The next prime is 20111137.

20111102 is nontrivially palindromic in base 10.

It is a self number, because there is not a number n which added to its sum of digits gives 20111102.

It is a congruent number.

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 7 ways as a sum of consecutive naturals, for example, 26513 + ... + 27260.

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

Almost surely, 220111102 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 53803.

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

The square root of 20111102 is about 4484.5403331891. The cubic root of 20111102 is about 271.9434625137.

It can be divided in two parts, 2011 and 1102, that multiplied together give a palindrome (2216122).

The spelling of 20111102 in words is "twenty million, one hundred eleven thousand, one hundred two".