Search a number
-
+
10110001001100 = 223527111337909901
BaseRepresentation
bin1001001100011110101100…
…0001001011001010001100
31022210111200100112002110020
42103013223001023022030
52311120240224013400
633300245332142140
72062265151414360
oct223075301131214
938714610462406
1010110001001100
113248699aa8290
121173476a67950
135844a4915ca0
1426d4804d32a0
15127eb71872a0
hex931eb04b28c

10110001001100 has 576 divisors, whose sum is σ = 40336406971392. Its totient is φ = 1886768640000.

The previous prime is 10110001001041. The next prime is 10110001001117. The reversal of 10110001001100 is 110010001101.

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 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 191 ways as a sum of consecutive naturals, for example, 10656150 + ... + 11566050.

Almost surely, 210110001001100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 10110001001100 its reverse (110010001101), we get a palindrome (10220011002201).

Subtracting from 10110001001100 its reverse (110010001101), we obtain a palindrome (9999990999999).

It can be divided in two parts, 10110001001 and 100, that added together give a palindrome (10110001101).

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