Search a number
-
+
100031200000 = 2855196581
BaseRepresentation
bin101110100101001010…
…0101111101100000000
3100120012100100110121021
41131022110233230000
53114330441400000
6113541555435224
710140603112414
oct1351224575400
9316170313537
10100031200000
1139472006126
12174782b5b14
139582114994
144bad262d44
152906d4e11a
hex174a52fb00

100031200000 has 216 divisors, whose sum is σ = 262748964240. Its totient is φ = 37900800000.

The previous prime is 100031199991. The next prime is 100031200043. The reversal of 100031200000 is 2130001.

It is an unprimeable number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15196710 + ... + 15203290.

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

Almost surely, 2100031200000 is an apocalyptic number.

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

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

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

100031200000 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 100031200000 its reverse (2130001), we get a palindrome (100033330001).

The spelling of 100031200000 in words is "one hundred billion, thirty-one million, two hundred thousand".