Search a number
-
+
110112001202010 = 235291092834103009
BaseRepresentation
bin11001000010010101110010…
…101101111001011101011010
3112102212121022200120100120010
4121002111302231321131122
5103413033334301431020
61030104431030142350
732123221016156313
oct3102256255713532
9472777280510503
10110112001202010
11320a3268078a65
121042453a4b19b6
134959695276862
141d29640c1360a
15cae3ec358de0
hex642572b7975a

110112001202010 has 128 divisors (see below), whose sum is σ = 276864549984000. Its totient is φ = 27991311409152.

The previous prime is 110112001201907. The next prime is 110112001202017. The reversal of 110112001202010 is 10202100211011.

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

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

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 24785386 + ... + 28888394.

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

Almost surely, 2110112001202010 is an apocalyptic number.

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

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

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

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

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

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

The sum of its prime factors is 4103440.

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

Adding to 110112001202010 its reverse (10202100211011), we get a palindrome (120314101413021).

Subtracting from 110112001202010 its reverse (10202100211011), we obtain a palindrome (99909900990999).

The spelling of 110112001202010 in words is "one hundred ten trillion, one hundred twelve billion, one million, two hundred two thousand, ten".

Divisors: 1 2 3 5 6 10 15 29 30 58 87 109 145 174 218 283 290 327 435 545 566 654 849 870 1090 1415 1635 1698 2830 3161 3270 4245 6322 8207 8490 9483 15805 16414 18966 24621 30847 31610 41035 47415 49242 61694 82070 92541 94830 123105 154235 185082 246210 308470 462705 894563 925410 1789126 2683689 4103009 4472815 5367378 8206018 8945630 12309027 13418445 20515045 24618054 26836890 41030090 61545135 118987261 123090270 237974522 356961783 447227981 594936305 713923566 894455962 1161151547 1189872610 1341683943 1784808915 2236139905 2322303094 2683367886 3483454641 3569617830 4472279810 5805757735 6708419715 6966909282 11611515470 12969611449 13416839430 17417273205 25939222898 33673394863 34834546410 38908834347 64848057245 67346789726 77817668694 101020184589 126565518623 129696114490 168366974315 194544171735 202040369178 253131037246 336733948630 379696555869 389088343470 505100922945 632827593115 759393111738 1010201845890 1265655186230 1898482779345 3670400040067 3796965558690 7340800080134 11011200120201 18352000200335 22022400240402 36704000400670 55056000601005 110112001202010