Search a number
-
+
1102001002111 = 10110910901011
BaseRepresentation
bin10000000010010100011…
…000001101011001111111
310220100110100022012121001
4100002110120031121333
5121023344224031421
62202130253551131
7142421416651642
oct20022430153177
93810410265531
101102001002111
113953a0922549
121596a9aa54a7
137cbc25137a9
143b4a1143a59
151d9eb4b0691
hex1009460d67f

1102001002111 has 4 divisors (see below), whose sum is σ = 1112911903224. Its totient is φ = 1091090101000.

The previous prime is 1102001002093. The next prime is 1102001002121. The reversal of 1102001002111 is 1112001002011.

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 1102001002111 - 29 = 1102001001599 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 21102001002111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 10910901112.

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

Adding to 1102001002111 its reverse (1112001002011), we get a palindrome (2214002004122).

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

Divisors: 1 101 10910901011 1102001002111