Search a number
-
+
20012220111 = 3133547144667
BaseRepresentation
bin10010101000110100…
…100011111011001111
31220122200112010002110
4102220310203323033
5311441112020421
613105443155103
71305631031022
oct225064437317
956580463073
1020012220111
11853a416194
123a66075a93
131b6c095b80
14d7bb871b9
157c1d81a76
hex4a8d23ecf

20012220111 has 16 divisors (see below), whose sum is σ = 28743795584. Its totient is φ = 12311655264.

The previous prime is 20012220103. The next prime is 20012220113. The reversal of 20012220111 is 11102221002.

It is not a de Polignac number, because 20012220111 - 23 = 20012220103 is a prime.

It is a super-2 number, since 2×200122201112 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 220012220111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 148230.

The product of its (nonzero) digits is 16, while the sum is 12.

Adding to 20012220111 its reverse (11102221002), we get a palindrome (31114441113).

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

Divisors: 1 3 13 39 3547 10641 46111 138333 144667 434001 1880671 5642013 513133849 1539401547 6670740037 20012220111