Search a number
-
+
20111220201 = 317596683689
BaseRepresentation
bin10010101110101110…
…001101110111101001
31220220120210211200110
4102232232031313221
5312141433021301
613123341124533
71311242360022
oct225656156751
956816724613
1020111220201
118590294446
123a93259749
131b867494c7
14d8ad97c49
157ca8da0d6
hex4aeb8dde9

20111220201 has 16 divisors (see below), whose sum is σ = 28873540800. Its totient is φ = 12404924928.

The previous prime is 20111220193. The next prime is 20111220211. The reversal of 20111220201 is 10202211102.

It is not a de Polignac number, because 20111220201 - 23 = 20111220193 is a prime.

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

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

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

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

Almost surely, 220111220201 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6683768.

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

Adding to 20111220201 its reverse (10202211102), we get a palindrome (30313431303).

Subtracting from 20111220201 its reverse (10202211102), we obtain a palindrome (9909009099).

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

Divisors: 1 3 17 51 59 177 1003 3009 6683689 20051067 113622713 340868139 394337651 1183012953 6703740067 20111220201