Search a number
-
+
100201110100 = 225271359186629
BaseRepresentation
bin101110101010001110…
…0111001101001010100
3100120122012001210102221
41131110130321221110
53120202441010400
6114010505312124
710145035245220
oct1352434715124
9316565053387
10100201110100
1139549a070a3
1217505195644
1395ab3950c0
144bc7a51780
152916c12c1a
hex1754739a54

100201110100 has 144 divisors (see below), whose sum is σ = 272151331200. Its totient is φ = 31174341120.

The previous prime is 100201110047. The next prime is 100201110101. The reversal of 100201110100 is 1011102001.

100201110100 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 (7).

It is a congruent number.

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

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

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

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

Almost surely, 2100201110100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 100201110100 its reverse (1011102001), we get a palindrome (101212212101).

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

Divisors: 1 2 4 5 7 10 13 14 20 25 26 28 35 50 52 59 65 70 91 100 118 130 140 175 182 236 260 295 325 350 364 413 455 590 650 700 767 826 910 1180 1300 1475 1534 1652 1820 2065 2275 2950 3068 3835 4130 4550 5369 5900 7670 8260 9100 10325 10738 15340 19175 20650 21476 26845 38350 41300 53690 76700 107380 134225 186629 268450 373258 536900 746516 933145 1306403 1866290 2426177 2612806 3732580 4665725 4852354 5225612 6532015 9331450 9704708 11011111 12130885 13064030 16983239 18662900 22022222 24261770 26128060 32660075 33966478 44044444 48523540 55055555 60654425 65320150 67932956 77077777 84916195 110111110 121308850 130640300 143144443 154155554 169832390 220222220 242617700 275277775 286288886 308311108 339664780 385388885 424580975 550555550 572577772 715722215 770777770 849161950 1002011101 1101111100 1431444430 1541555540 1698323900 1926944425 2004022202 2862888860 3578611075 3853888850 4008044404 5010055505 7157222150 7707777700 10020111010 14314444300 20040222020 25050277525 50100555050 100201110100