Search a number
BaseRepresentation
bin10011000101000011101…
…101011100010010011100
311122100011212212020122102
4103011003231130102130
5132440113324323400
62442151140504232
7163503206500256
oct23050355342234
94570155766572
101311101011100
11466042382131
121921250ab078
1396836c2a86a
1447659a30cd6
15241887b89d5
hex13143b5c49c

1311101011100 has 36 divisors (see below), whose sum is σ = 2847434955624. Its totient is φ = 524008006080.

The previous prime is 1311101011067. The next prime is 1311101011117. The reversal of 1311101011100 is 11101011131.

Adding to 1311101011100 its reverse (11101011131), we get a palindrome (1322202022231).

It is a super-2 number, since 2×13111010111002 (a number of 25 digits) contains 22 as substring.

It is a congruent number.

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 11 ways as a sum of consecutive naturals, for example, 5283074 + ... + 5525673.

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

Almost surely, 21311101011100 is an apocalyptic number.

1311101011100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 3, while the sum is 11.

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