Search a number
-
+
101101000002100 = 22527827174643289
BaseRepresentation
bin10110111111001101101001…
…001100010000101000110100
3111020222011100112001200000021
4112333031221030100220310
5101222414322000031400
6555005054101454524
730203210012556640
oct2677155114205064
9436864315050007
10101101000002100
112a23976989258a
12b40a074411444
134454a2515c327
141ad7459027c20
15ba4d07e5271a
hex5bf369310a34

101101000002100 has 72 divisors (see below), whose sum is σ = 251033662192320. Its totient is φ = 34621285413120.

The previous prime is 101101000002091. The next prime is 101101000002109. The reversal of 101101000002100 is 1200000101101.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101101000002109) 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 23 ways as a sum of consecutive naturals, for example, 86742745 + ... + 87900544.

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

Almost surely, 2101101000002100 is an apocalyptic number.

101101000002100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

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

Adding to 101101000002100 its reverse (1200000101101), we get a palindrome (102301000103201).

Subtracting from 101101000002100 its reverse (1200000101101), we obtain a palindrome (99900999900999).

The spelling of 101101000002100 in words is "one hundred one trillion, one hundred one billion, two thousand, one hundred".

Divisors: 1 2 4 5 7 10 14 20 25 28 35 50 70 100 140 175 350 700 827 1654 3308 4135 5789 8270 11578 16540 20675 23156 28945 41350 57890 82700 115780 144725 289450 578900 174643289 349286578 698573156 873216445 1222503023 1746432890 2445006046 3492865780 4366082225 4890012092 6112515115 8732164450 12225030230 17464328900 24450060460 30562575575 61125151150 122250302300 144430000003 288860000006 577720000012 722150000015 1011010000021 1444300000030 2022020000042 2888600000060 3610750000075 4044040000084 5055050000105 7221500000150 10110100000210 14443000000300 20220200000420 25275250000525 50550500001050 101101000002100