Search a number
-
+
1100511111101 = 71591050114639
BaseRepresentation
bin10000000000111011100…
…100101110011110111101
310220012121111210220100112
4100000323210232132331
5121012321321023401
62201322352235405
7142336456046243
oct20007344563675
93805544726315
101100511111101
113947a6917366
12159352b3bb65
137ca1595088c
143b39d312793
151d9607b13bb
hex1003b92e7bd

1100511111101 has 8 divisors (see below), whose sum is σ = 1100844844800. Its totient is φ = 1100177442000.

The previous prime is 1100511111043. The next prime is 1100511111107. The reversal of 1100511111101 is 1011111150011.

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

It is a cyclic number.

It is not a de Polignac number, because 1100511111101 - 226 = 1100444002237 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1100511111107) 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, 75169340 + ... + 75183978.

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

Almost surely, 21100511111101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 32299.

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

Adding to 1100511111101 its reverse (1011111150011), we get a palindrome (2111622261112).

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

Divisors: 1 7159 10501 14639 75176659 104800601 153724139 1100511111101