Search a number
-
+
1100200211013 = 3616012023011
BaseRepresentation
bin10000000000101001000…
…010101111001001000101
310220011210211210112121110
4100000221002233021011
5121011202223223023
62201231444435233
7142325662331061
oct20005102571105
93804724715543
101100200211013
11394657378542
121592869a8b19
137c996407627
143b36dd02aa1
151d94334ca93
hex100290af245

1100200211013 has 8 divisors (see below), whose sum is σ = 1490981706976. Its totient is φ = 721442761200.

The previous prime is 1100200210987. The next prime is 1100200211021. The reversal of 1100200211013 is 3101120020011.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 1100200211013 - 28 = 1100200210757 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 1100200211013.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1100200211053) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3006011323 + ... + 3006011688.

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

Almost surely, 21100200211013 is an apocalyptic number.

It is an amenable number.

1100200211013 is a deficient number, since it is larger than the sum of its proper divisors (390781495963).

1100200211013 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 6012023075.

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

Adding to 1100200211013 its reverse (3101120020011), we get a palindrome (4201320231024).

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

Divisors: 1 3 61 183 6012023011 18036069033 366733403671 1100200211013