Search a number
-
+
101023211320000 = 26544793526931
BaseRepresentation
bin10110111110000101001100…
…100111111111001011000000
3111020200201120021221011220021
4112332011030213333023000
5101220131014044220000
6554505231140223224
730164454231643204
oct2676051447771300
9436621507834807
10101023211320000
112a209781136362
12b3b6b8509ab14
13444a5a91bc558
141ad3799c34b04
15ba2ca3b8911a
hex5be14c9ff2c0

101023211320000 has 140 divisors (see below), whose sum is σ = 250557471737496. Its totient is φ = 40400776960000.

The previous prime is 101023211319929. The next prime is 101023211320007. The reversal of 101023211320000 is 23112320101.

101023211320000 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×1010232113200002 (a number of 29 digits) contains 22 as substring.

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

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

It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 191456535 + ... + 191983465.

Almost surely, 2101023211320000 is an apocalyptic number.

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

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

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

101023211320000 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 101023211320000 its reverse (23112320101), we get a palindrome (101046323640101).

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

Divisors: 1 2 4 5 8 10 16 20 25 32 40 50 64 80 100 125 160 200 250 320 400 500 625 800 1000 1250 1600 2000 2500 4000 4793 5000 8000 9586 10000 19172 20000 23965 38344 40000 47930 76688 95860 119825 153376 191720 239650 306752 383440 479300 526931 599125 766880 958600 1053862 1198250 1533760 1917200 2107724 2396500 2634655 2995625 3834400 4215448 4793000 5269310 5991250 7668800 8430896 9586000 10538620 11982500 13173275 16861792 19172000 21077240 23965000 26346550 33723584 38344000 42154480 47930000 52693100 65866375 84308960 95860000 105386200 131732750 168617920 191720000 210772400 263465500 329331875 421544800 526931000 658663750 843089600 1053862000 1317327500 2107724000 2525580283 2634655000 4215448000 5051160566 5269310000 10102321132 10538620000 12627901415 20204642264 21077240000 25255802830 40409284528 50511605660 63139507075 80818569056 101023211320 126279014150 161637138112 202046422640 252558028300 315697535375 404092845280 505116056600 631395070750 808185690560 1010232113200 1262790141500 1578487676875 2020464226400 2525580283000 3156975353750 4040928452800 5051160566000 6313950707500 10102321132000 12627901415000 20204642264000 25255802830000 50511605660000 101023211320000