Search a number
-
+
101011010111010 = 23352920176395891
BaseRepresentation
bin10110111101111001110101…
…011000000100011000100010
3111020122120001222012112201000
4112331321311120010120202
5101214431022042023020
6554455452322052430
730163542665245266
oct2675716530043042
9436576058175630
10101011010111010
112a20458a94646a
12b3b473aaaa116
1344493b346936c
141ad2d5d5dc0a6
15ba27dc921090
hex5bde75604622

101011010111010 has 128 divisors (see below), whose sum is σ = 278789257209600. Its totient is φ = 25994534307840.

The previous prime is 101011010110973. The next prime is 101011010111017. The reversal of 101011010111010 is 10111010110101.

101011010111010 is digitally balanced in base 3, 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 = 101011010110983 and 101011010111001.

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

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, 12595165 + ... + 18991055.

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

Almost surely, 2101011010111010 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101011010111010 its reverse (10111010110101), we get a palindrome (111122020221111).

Subtracting from 101011010111010 its reverse (10111010110101), we obtain a palindrome (90900000000909).

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

Divisors: 1 2 3 5 6 9 10 15 18 27 29 30 45 54 58 87 90 135 145 174 261 270 290 435 522 783 870 1305 1566 2017 2610 3915 4034 6051 7830 10085 12102 18153 20170 30255 36306 54459 58493 60510 90765 108918 116986 175479 181530 272295 292465 350958 526437 544590 584930 877395 1052874 1579311 1754790 2632185 3158622 5264370 6395891 7896555 12791782 15793110 19187673 31979455 38375346 57563019 63958910 95938365 115126038 172689057 185480839 191876730 287815095 345378114 370961678 556442517 575630190 863445285 927404195 1112885034 1669327551 1726890570 1854808390 2782212585 3338655102 5007982653 5564425170 8346637755 10015965306 12900512147 16693275510 25039913265 25801024294 38701536441 50079826530 64502560735 77403072882 116104609323 129005121470 193507682205 232209218646 348313827969 374114852263 387015364410 580523046615 696627655938 748229704526 1122344556789 1161046093230 1741569139845 1870574261315 2244689113578 3367033670367 3483138279690 3741148522630 5611722783945 6734067340734 10101101011101 11223445567890 16835168351835 20202202022202 33670336703670 50505505055505 101011010111010