Search a number
-
+
103331213111100 = 2235213431274851709
BaseRepresentation
bin10111011111101010101100…
…010000000110111100111100
3111112212100220220111011102210
4113133222230100012330330
5102020434311024023400
61003433412020420420
730523301534323632
oct2737525420067474
9445770826434383
10103331213111100
112aa19580a64537
12b70a346247710
1345871262a1950
141b73386439352
15be2d36a76950
hex5dfaac406f3c

103331213111100 has 288 divisors, whose sum is σ = 332051342909440. Its totient is φ = 24648229186560.

The previous prime is 103331213111089. The next prime is 103331213111129. The reversal of 103331213111100 is 1111312133301.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 18872046 + ... + 23723754.

Almost surely, 2103331213111100 is an apocalyptic number.

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

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

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

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

103331213111100 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 162, while the sum is 21.

Adding to 103331213111100 its reverse (1111312133301), we get a palindrome (104442525244401).

The spelling of 103331213111100 in words is "one hundred three trillion, three hundred thirty-one billion, two hundred thirteen million, one hundred eleven thousand, one hundred".