Search a number
-
+
1100200111010 = 2572111354129023
BaseRepresentation
bin10000000000101001000…
…010010110101110100010
310220011210211121110102122
4100000221002112232202
5121011202212023020
62201231442344242
7142325661433400
oct20005102265642
93804724543378
101100200111010
1139465730a3a0
1215928695b082
137c9963a0c60
143b36dcb8470
151d94332d125
hex10029096ba2

1100200111010 has 192 divisors, whose sum is σ = 2711522386944. Its totient is φ = 315945100800.

The previous prime is 1100200110941. The next prime is 1100200111067. The reversal of 1100200111010 is 101110020011.

It is a happy 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, 37893359 + ... + 37922381.

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

Almost surely, 21100200111010 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 8.

Adding to 1100200111010 its reverse (101110020011), we get a palindrome (1201310131021).

Subtracting from 1100200111010 its reverse (101110020011), we obtain a palindrome (999090090999).

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