Search a number
-
+
110130330110020 = 2251110110061492631
BaseRepresentation
bin11001000010100110110111…
…001101001000100001000100
3112102221100122001122100112221
4121002212313031020201010
5103413333404002010040
61030121101502222124
732124440150261023
oct3102466715104104
9472840561570487
10110130330110020
1132100013289920
1210427bb4884944
13495b326686b5c
141d2a49d1ba8ba
15caeb2153174a
hex6429b7348844

110130330110020 has 96 divisors (see below), whose sum is σ = 254822422563072. Its totient is φ = 39646862400000.

The previous prime is 110130330109991. The next prime is 110130330110039. The reversal of 110130330110020 is 20011033031011.

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

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

It is an unprimeable number.

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 31 ways as a sum of consecutive naturals, for example, 223309105 + ... + 223801735.

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

Almost surely, 2110130330110020 is an apocalyptic number.

110130330110020 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 110130330110020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127411211281536).

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

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

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

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

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

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

Adding to 110130330110020 its reverse (20011033031011), we get a palindrome (130141363141031).

The spelling of 110130330110020 in words is "one hundred ten trillion, one hundred thirty billion, three hundred thirty million, one hundred ten thousand, twenty".

Divisors: 1 2 4 5 10 11 20 22 44 55 101 110 202 220 404 505 1010 1111 2020 2222 4444 5555 10061 11110 20122 22220 40244 50305 100610 110671 201220 221342 442684 492631 553355 985262 1016161 1106710 1970524 2032322 2213420 2463155 4064644 4926310 5080805 5418941 9852620 10161610 10837882 11177771 20323220 21675764 22355542 27094705 44711084 49755731 54189410 55888855 99511462 108378820 111777710 199022924 223555420 248778655 497557310 547313041 995114620 1094626082 2189252164 2736565205 4956360491 5473130410 9912720982 10946260820 19825441964 24781802455 49563604910 54519965401 99127209820 109039930802 218079861604 272599827005 500592409591 545199654010 1001184819182 1090399308020 2002369638364 2502962047955 5005924095910 5506516505501 10011848191820 11013033011002 22026066022004 27532582527505 55065165055010 110130330110020