Search a number
-
+
1010002010100 = 2235253631100669
BaseRepresentation
bin11101011001010001100…
…11111001111111110100
310120112222202222011221120
432230220303321333310
5113021441003310400
62051553304143540
7132653535302226
oct16545063717764
93515882864846
101010002010100
1135a380893146
121438b3767bb0
137432050ac05
1436c54970416
151b4148beca0
hexeb28cf9ff4

1010002010100 has 144 divisors (see below), whose sum is σ = 2982157879680. Its totient is φ = 263830694400.

The previous prime is 1010002010081. The next prime is 1010002010119. The reversal of 1010002010100 is 10102000101.

It is an interprime number because it is at equal distance from previous prime (1010002010081) and next prime (1010002010119).

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9982566 + ... + 10083234.

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

Almost surely, 21010002010100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 1010002010100 its reverse (10102000101), we get a palindrome (1020104010201).

Subtracting from 1010002010100 its reverse (10102000101), we obtain a palindrome (999900009999).

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

Divisors: 1 2 3 4 5 6 10 12 15 20 25 30 50 53 60 75 100 106 150 159 212 265 300 318 530 631 636 795 1060 1262 1325 1590 1893 2524 2650 3155 3180 3786 3975 5300 6310 7572 7950 9465 12620 15775 15900 18930 31550 33443 37860 47325 63100 66886 94650 100329 100669 133772 167215 189300 200658 201338 302007 334430 401316 402676 501645 503345 604014 668860 836075 1003290 1006690 1208028 1510035 1672150 2006580 2013380 2508225 2516725 3020070 3344300 5016450 5033450 5335457 6040140 7550175 10032900 10066900 10670914 15100350 16006371 21341828 26677285 30200700 32012742 53354570 63522139 64025484 80031855 106709140 127044278 133386425 160063710 190566417 254088556 266772850 317610695 320127420 381132834 400159275 533545700 635221390 762265668 800318550 952832085 1270442780 1588053475 1600637100 1905664170 3176106950 3366673367 3811328340 4764160425 6352213900 6733346734 9528320850 10100020101 13466693468 16833366835 19056641700 20200040202 33666733670 40400080404 50500100505 67333467340 84166834175 101000201010 168333668350 202000402020 252500502525 336667336700 505001005050 1010002010100