Search a number
-
+
1100111101101 = 32156778005467
BaseRepresentation
bin10000000000100011101…
…110110011110010101101
310220011120122010021210100
4100000203232303302231
5121011011420213401
62201214542501313
7142323531033315
oct20004356636255
93804518107710
101100111101101
11394611044991
12159260b94839
137c980b0787c
143b362148445
151d93a5e9b86
hex10023bb3cad

1100111101101 has 12 divisors (see below), whose sum is σ = 1590063459712. Its totient is φ = 732939358536.

The previous prime is 1100111101081. The next prime is 1100111101139. The reversal of 1100111101101 is 1011011110011.

It is not a de Polignac number, because 1100111101101 - 217 = 1100110970029 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

It is a congruent number.

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

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, 38988631 + ... + 39016836.

Almost surely, 21100111101101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 1100111101101 its reverse (1011011110011), we get a palindrome (2111122211112).

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

Divisors: 1 3 9 1567 4701 14103 78005467 234016401 702049203 122234566789 366703700367 1100111101101