Search a number
-
+
100110010011000 = 23353114771909091
BaseRepresentation
bin10110110000110010101101…
…100101011100110101111000
3111010110102102201120010011120
4112300302231211130311320
5101110200300030323000
6552525523111025240
730041465241616263
oct2660625545346570
9433412381503146
10100110010011000
1129997464874740
12b289ba796b220
1343b2444739702
141aa14c947dcda
15b891576e36a0
hex5b0cad95cd78

100110010011000 has 512 divisors, whose sum is σ = 352889441648640. Its totient is φ = 23418158400000.

The previous prime is 100110010010951. The next prime is 100110010011013. The reversal of 100110010011000 is 110010011001.

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 self number, because there is not a number n which added to its sum of digits gives 100110010011000.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 109666455 + ... + 110575545.

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

Almost surely, 2100110010011000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 100110010011000 its reverse (110010011001), we get a palindrome (100220020022001).

Subtracting from 100110010011000 its reverse (110010011001), we obtain a palindrome (99999999999999).

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