Search a number
-
+
102011002222120 = 23529239491749393
BaseRepresentation
bin10111001100011101001001…
…100011001111011000101000
3111101012011020010210011122221
4113030131021203033120220
5101332322013032101440
61000543112451323424
730326023506036535
oct2714351143173050
9441164203704587
10102011002222120
112a55a694373312
12b5364ba2b0574
1344bc799c02204
141b2950498dd8c
15bbd818629d4a
hex5cc7498cf628

102011002222120 has 128 divisors (see below), whose sum is σ = 238918797504000. Its totient is φ = 39152554577920.

The previous prime is 102011002222111. The next prime is 102011002222127. The reversal of 102011002222120 is 21222200110201.

It is a happy number.

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

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

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

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

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

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

Almost surely, 2102011002222120 is an apocalyptic number.

102011002222120 is a gapful number since it is divisible by the number (10) 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 102011002222120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119459398752000).

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

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

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

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

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

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

Adding to 102011002222120 its reverse (21222200110201), we get a palindrome (123233202332321).

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

Divisors: 1 2 4 5 8 10 20 29 40 58 116 145 232 239 290 478 491 580 956 982 1160 1195 1912 1964 2390 2455 3928 4780 4910 6931 9560 9820 13862 14239 19640 27724 28478 34655 55448 56956 69310 71195 113912 117349 138620 142390 234698 277240 284780 469396 569560 586745 749393 938792 1173490 1498786 2346980 2997572 3403121 3746965 4693960 5995144 6806242 7493930 13612484 14987860 17015605 21732397 27224968 29975720 34031210 43464794 68062420 86929588 108661985 136124840 173859176 179104927 217323970 358209854 367951963 434647940 716419708 735903926 869295880 895524635 1432839416 1471807852 1791049270 1839759815 2943615704 3582098540 3679519630 5194042883 7164197080 7359039260 10388085766 10670606927 14718078520 20776171532 21341213854 25970214415 41552343064 42682427708 51940428830 53353034635 85364855416 87940519157 103880857660 106706069270 175881038314 207761715320 213412138540 351762076628 426824277080 439702595785 703524153256 879405191570 1758810383140 2550275055553 3517620766280 5100550111106 10201100222212 12751375277765 20402200444424 25502750555530 51005501111060 102011002222120