Search a number
-
+
100100011001100 = 223521197884935339
BaseRepresentation
bin10110110000101001011001…
…100110010000010100001100
3111010102110121212122210012120
4112300221121212100110030
5101110014310304013400
6552521151001332540
730040662405500025
oct2660513146202414
9433373555583176
10100100011001100
11299931a36765a0
12b288077197150
1343b1510007ac6
141aa0c1b4d7c4c
15b88c6e97dca0
hex5b0a5999050c

100100011001100 has 288 divisors, whose sum is σ = 319254378912000. Its totient is φ = 24013103923200.

The previous prime is 100100011001099. The next prime is 100100011001191. The reversal of 100100011001100 is 1100110001001.

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.

100100011001100 is a modest number, since divided by 11001100 gives 1001000 as remainder.

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 95 ways as a sum of consecutive naturals, for example, 2832547231 + ... + 2832582569.

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

Almost surely, 2100100011001100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 100100011001100 its reverse (1100110001001), we get a palindrome (101200121002101).

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