Search a number
-
+
20111121570 = 2352329146553
BaseRepresentation
bin10010101110101101…
…110101110010100010
31220220120121211101110
4102232231311302202
5312141421342240
613123335044150
71311241466331
oct225655656242
956816554343
1020111121570
118590227331
123a93210656
131b86713647
14d8ad6dd18
157ca8bac80
hex4aeb75ca2

20111121570 has 32 divisors (see below), whose sum is σ = 50365245312. Its totient is φ = 5129793152.

The previous prime is 20111121529. The next prime is 20111121571. The reversal of 20111121570 is 7512111102.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (20111121571) 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, 14572587 + ... + 14573966.

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

Almost surely, 220111121570 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 29146586.

The product of its (nonzero) digits is 140, while the sum is 21.

Adding to 20111121570 its reverse (7512111102), we get a palindrome (27623232672).

The spelling of 20111121570 in words is "twenty billion, one hundred eleven million, one hundred twenty-one thousand, five hundred seventy".

Divisors: 1 2 3 5 6 10 15 23 30 46 69 115 138 230 345 690 29146553 58293106 87439659 145732765 174879318 291465530 437198295 670370719 874396590 1340741438 2011112157 3351853595 4022224314 6703707190 10055560785 20111121570