Search a number
-
+
100020111300 = 22325243109131181
BaseRepresentation
bin101110100100110101…
…0011100011111000100
3100120011120111002202200
41131021222130133010
53114320122030200
6113540522034500
710140406630014
oct1351152343704
9316146432680
10100020111300
113946682200a
1217474648a30
13957ca31715
144bab9b7c44
152905dad800
hex1749a9c7c4

100020111300 has 432 divisors, whose sum is σ = 328015047360. Its totient is φ = 25474176000.

The previous prime is 100020111299. The next prime is 100020111313. The reversal of 100020111300 is 3111020001.

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

It is an unprimeable number.

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 143 ways as a sum of consecutive naturals, for example, 552597210 + ... + 552597390.

Almost surely, 2100020111300 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 100020111300 its reverse (3111020001), we get a palindrome (103131131301).

The spelling of 100020111300 in words is "one hundred billion, twenty million, one hundred eleven thousand, three hundred".