Search a number
-
+
20021112110 = 252002111211
BaseRepresentation
bin10010101001010110…
…011110110100101110
31220200022020212121202
4102221112132310232
5312000401041420
613110401525502
71306066434146
oct225126366456
956608225552
1020021112110
11854443994a
123a69043892
131b70b8a2cc
14d7d01d926
157c2a3b575
hex4a959ed2e

20021112110 has 8 divisors (see below), whose sum is σ = 36038001816. Its totient is φ = 8008444840.

The previous prime is 20021112103. The next prime is 20021112173. The reversal of 20021112110 is 1121112002.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a Curzon number.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1001055596 + ... + 1001055615.

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

Almost surely, 220021112110 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2002111218.

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

Adding to 20021112110 its reverse (1121112002), we get a palindrome (21142224112).

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

Divisors: 1 2 5 10 2002111211 4004222422 10010556055 20021112110