Search a number
-
+
100110011100000 = 2535511233130199
BaseRepresentation
bin10110110000110010101101…
…101001100110101101100000
3111010110102102210121102222220
4112300302231221212231200
5101110200300320200000
6552525523150231040
730041465254103226
oct2660625551465540
9433412383542886
10100110011100000
1129997465448940
12b289ba81b5480
1343b2444a2b2a5
141aa14c9684b16
15b8915785b1a0
hex5b0cada66b60

100110011100000 has 576 divisors, whose sum is σ = 359866042099200. Its totient is φ = 24164748800000.

The previous prime is 100110011099939. The next prime is 100110011100007. The reversal of 100110011100000 is 1110011001.

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is a congruent number.

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

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

Almost surely, 2100110011100000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 100110011100000 its reverse (1110011001), we get a palindrome (100111121111001).

The spelling of 100110011100000 in words is "one hundred trillion, one hundred ten billion, eleven million, one hundred thousand".