Search a number
-
+
100110011010012 = 22348320831787167
BaseRepresentation
bin10110110000110010101101…
…101001010000101111011100
3111010110102102210102212120000
4112300302231221100233130
5101110200300304310022
6552525523144254300
730041465253246663
oct2660625551205734
9433412383385500
10100110011010012
1129997465397273
12b289ba8171390
1343b24449c9343
141aa14c965ddda
15b8915783e6ac
hex5b0cada50bdc

100110011010012 has 120 divisors (see below), whose sum is σ = 264987745752576. Its totient is φ = 32952109843872.

The previous prime is 100110011010011. The next prime is 100110011010049. The reversal of 100110011010012 is 210010110011001.

100110011010012 is digitally balanced in base 4, 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 (9).

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

It is a congruent number.

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

It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 55122453 + ... + 56909619.

Almost surely, 2100110011010012 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 9.

Adding to 100110011010012 its reverse (210010110011001), we get a palindrome (310120121021013).

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

Divisors: 1 2 3 4 6 9 12 18 27 36 54 81 83 108 162 166 249 324 332 498 747 996 1494 2083 2241 2988 4166 4482 6249 6723 8332 8964 12498 13446 18747 24996 26892 37494 56241 74988 112482 168723 172889 224964 337446 345778 518667 674892 691556 1037334 1556001 1787167 2074668 3112002 3574334 4668003 5361501 6224004 7148668 9336006 10723002 14004009 16084503 18672012 21446004 28008018 32169006 48253509 56016036 64338012 96507018 144760527 148334861 193014036 289521054 296669722 445004583 579042108 593339444 890009166 1335013749 1780018332 2670027498 3722668861 4005041247 5340054996 7445337722 8010082494 11168006583 12015123741 14890675444 16020164988 22336013166 24030247482 33504019749 44672026332 48060494964 67008039498 100512059247 134016078996 201024118494 301536177741 308981515463 402048236988 603072355482 617963030926 926944546389 1206144710964 1235926061852 1853889092778 2780833639167 3707778185556 5561667278334 8342500917501 11123334556668 16685001835002 25027502752503 33370003670004 50055005505006 100110011010012