Search a number
-
+
10100551005510 = 235739371047587
BaseRepresentation
bin1001001011111011011111…
…0000010011010101000110
31022202121021202200120112120
42102332313300103111012
52310441412024134020
633252043514030410
72061512032653000
oct222766760232506
938677252616476
1010100551005510
11324468a7a3779
12117167a118406
13583629b6b014
1426cc25421370
15127b1271d740
hex92fb7c13546

10100551005510 has 128 divisors (see below), whose sum is σ = 28299961267200. Its totient is φ = 2306231246592.

The previous prime is 10100551005451. The next prime is 10100551005563. The reversal of 10100551005510 is 1550015500101.

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

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 210100551005510 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 625, while the sum is 24.

Adding to 10100551005510 its reverse (1550015500101), we get a palindrome (11650566505611).

The spelling of 10100551005510 in words is "ten trillion, one hundred billion, five hundred fifty-one million, five thousand, five hundred ten".

Divisors: 1 2 3 5 6 7 10 14 15 21 30 35 42 49 70 98 105 147 210 245 294 343 490 686 735 937 1029 1470 1715 1874 2058 2811 3430 4685 5145 5622 6559 9370 10290 13118 14055 19677 28110 32795 39354 45913 65590 91826 98385 137739 196770 229565 275478 321391 459130 642782 688695 964173 1047587 1377390 1606955 1928346 2095174 3142761 3213910 4820865 5237935 6285522 7333109 9641730 10475870 14666218 15713805 21999327 31427610 36665545 43998654 51331763 73331090 102663526 109996635 153995289 219993270 256658815 307990578 359322341 513317630 718644682 769976445 981589019 1077967023 1539952890 1796611705 1963178038 2155934046 2944767057 3593223410 4907945095 5389835115 5889534114 6871123133 9815890190 10779670230 13742246266 14723835285 20613369399 29447670570 34355615665 41226738798 48097861931 68711231330 96195723862 103066846995 144293585793 206133693990 240489309655 288587171586 336685033517 480978619310 673370067034 721467928965 1010055100551 1442935857930 1683425167585 2020110201102 3366850335170 5050275502755 10100551005510