Search a number
-
+
1100511060109 = 2621419882129
BaseRepresentation
bin10000000000111011100…
…100100010000010001101
310220012121111201022101221
4100000323210202002031
5121012321312410414
62201322351203341
7142336455444466
oct20007344420215
93805544638357
101100511060109
113947a689201a
12159352b16551
137ca159335c6
143b39d2dbd6d
151d9607a1224
hex1003b92208d

1100511060109 has 4 divisors (see below), whose sum is σ = 1100930944860. Its totient is φ = 1100091175360.

The previous prime is 1100511060073. The next prime is 1100511060113. The reversal of 1100511060109 is 9010601150011.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 948438358884 + 152072701225 = 973878^2 + 389965^2 .

It is a cyclic number.

It is not a de Polignac number, because 1100511060109 - 213 = 1100511051917 is a prime.

It is a super-2 number, since 2×11005110601092 (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 (1100511060119) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 209938444 + ... + 209943685.

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

Almost surely, 21100511060109 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 419884750.

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

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

Divisors: 1 2621 419882129 1100511060109