Search a number
-
+
100102001101300 = 225211210313802181
BaseRepresentation
bin10110110000101011010000…
…001101111000100111110100
3111010102122202120101100110101
4112300223100031320213310
5101110032344240220200
6552522120252203444
730041062622200312
oct2660532015704764
9433378676340411
10100102001101300
1129994024a71300
12b288531769584
1343b17693c70a3
141aa0d699370b2
15b88d3953826a
hex5b0ad03789f4

100102001101300 has 108 divisors (see below), whose sum is σ = 238787404276428. Its totient is φ = 36397152704000.

The previous prime is 100102001101253. The next prime is 100102001101301. The reversal of 100102001101300 is 3101100201001.

It can be written as a sum of positive squares in 6 ways, for example, as 2808989408016 + 97293011693284 = 1676004^2 + 9863722^2 .

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

It is a congruent number.

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

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

Almost surely, 2100102001101300 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 100102001101300 its reverse (3101100201001), we get a palindrome (103203101302301).

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

Divisors: 1 2 4 5 10 11 20 22 25 44 50 55 100 110 121 220 242 275 484 550 605 1100 1210 2420 3025 6050 10313 12100 20626 41252 51565 103130 113443 206260 226886 257825 453772 515650 567215 802181 1031300 1134430 1247873 1604362 2268860 2495746 2836075 3208724 4010905 4991492 5672150 6239365 8021810 8823991 11344300 12478730 16043620 17647982 20054525 24957460 31196825 35295964 40109050 44119955 62393650 80218100 88239910 97063901 124787300 176479820 194127802 220599775 388255604 441199550 485319505 882399100 970639010 1941278020 2426597525 4853195050 8272892653 9706390100 16545785306 33091570612 41364463265 82728926530 91001819183 165457853060 182003638366 206822316325 364007276732 413644632650 455009095915 827289265300 910018191830 1001020011013 1820036383660 2002040022026 2275045479575 4004080044052 4550090959150 5005100055065 9100181918300 10010200110130 20020400220260 25025500275325 50051000550650 100102001101300