Search a number
-
+
1102221111111 = 3367407037037
BaseRepresentation
bin10000000010100001011…
…111110110111101000111
310220101000200110220101020
4100002201133312331013
5121024322101023421
62202204155402223
7142430031601101
oct20024137667507
93811020426336
101102221111111
113954a409a70a
1215974b753373
137cc28cbb9c3
143b4c247c571
151da1098cdc6
hex100a17f6f47

1102221111111 has 4 divisors (see below), whose sum is σ = 1469628148152. Its totient is φ = 734814074072.

The previous prime is 1102221111011. The next prime is 1102221111127. The reversal of 1102221111111 is 1111111222011.

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

It is a cyclic number.

It is not a de Polignac number, because 1102221111111 - 211 = 1102221109063 is a prime.

1102221111111 is a modest number, since divided by 1111111 gives 110222 as remainder.

It is a congruent number.

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

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

Almost surely, 21102221111111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 367407037040.

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

Adding to 1102221111111 its reverse (1111111222011), we get a palindrome (2213332333122).

The spelling of 1102221111111 in words is "one trillion, one hundred two billion, two hundred twenty-one million, one hundred eleven thousand, one hundred eleven".

Divisors: 1 3 367407037037 1102221111111