Search a number
-
+
1101102010111 = 31247671434143
BaseRepresentation
bin10000000001011110110…
…010110100111011111111
310220021010200200200102001
4100001132302310323333
5121020024103310421
62201501141243131
7142360222442005
oct20013662647377
93807120620361
101101102010111
11394a7a419554
12159498a034a7
137caab1b0b6c
143b4179aaa75
151d9975d2691
hex1005ecb4eff

1101102010111 has 8 divisors (see below), whose sum is σ = 1136668114944. Its totient is φ = 1065538823160.

The previous prime is 1101102010081. The next prime is 1101102010123. The reversal of 1101102010111 is 1110102011011.

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 1101102010111 - 25 = 1101102010079 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 (1101102010181) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50706 + ... + 1484848.

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

Almost surely, 21101102010111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1458941.

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

Adding to 1101102010111 its reverse (1110102011011), we get a palindrome (2211204021122).

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

Divisors: 1 31 24767 767777 1434143 44458433 35519419681 1101102010111