Search a number
-
+
20011022220120 = 23351677649130547
BaseRepresentation
bin1001000110011001011011…
…10111101111101101011000
32121212000221112201022011120
410203030231313233231120
510110330033142020440
6110320534154325240
74133514533241261
oct443145567575530
977760845638146
1020011022220120
1164156993a2168
1222b232aa29820
13b220539bb189
144d2778073968
1524a7ec863dd0
hex12332ddefb58

20011022220120 has 128 divisors (see below), whose sum is σ = 60400904256000. Its totient is φ = 5303584772096.

The previous prime is 20011022220089. The next prime is 20011022220127. The reversal of 20011022220120 is 2102222011002.

20011022220120 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.

It is a Harshad number since it is a multiple of its sum of digits (15).

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

It is a congruent number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 153220687 + ... + 153351233.

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

Almost surely, 220011022220120 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 20011022220120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30200452128000).

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

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

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

20011022220120 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 138377 (or 138373 counting only the distinct ones).

The product of its (nonzero) digits is 64, while the sum is 15.

Adding to 20011022220120 its reverse (2102222011002), we get a palindrome (22113244231122).

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

Divisors: 1 2 3 4 5 6 8 10 12 15 20 24 30 40 60 120 167 334 501 668 835 1002 1336 1670 2004 2505 3340 4008 5010 6680 7649 10020 15298 20040 22947 30596 38245 45894 61192 76490 91788 114735 130547 152980 183576 229470 261094 305960 391641 458940 522188 652735 783282 917880 1044376 1277383 1305470 1566564 1958205 2554766 2610940 3133128 3832149 3916410 5109532 5221880 6386915 7664298 7832820 10219064 12773830 15328596 15665640 19160745 21801349 25547660 30657192 38321490 43602698 51095320 65404047 76642980 87205396 109006745 130808094 153285960 174410792 218013490 261616188 327020235 436026980 523232376 654040470 872053960 998554003 1308080940 1997108006 2616161880 2995662009 3994216012 4992770015 5991324018 7988432024 9985540030 11982648036 14978310045 19971080060 23965296072 29956620090 39942160120 59913240180 119826480360 166758518501 333517037002 500275555503 667034074004 833792592505 1000551111006 1334068148008 1667585185010 2001102222012 2501377777515 3335170370020 4002204444024 5002755555030 6670340740040 10005511110060 20011022220120