Search a number
-
+
1110010111111 = 11100910010101
BaseRepresentation
bin10000001001110001110…
…000100010010010000111
310221010010111212002200201
4100021301300202102013
5121141300042023421
62205533120551331
7143124041160646
oct20116160422207
93833114762621
101110010111111
113988308516a0
1215b164182547
138089a8c5a45
143ba20add35d
151dd196a9b91
hex10271c22487

1110010111111 has 4 divisors (see below), whose sum is σ = 1210920121224. Its totient is φ = 1009100101000.

The previous prime is 1110010111099. The next prime is 1110010111193. The reversal of 1110010111111 is 1111110100111.

It is a happy number.

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 1110010111111 - 215 = 1110010078343 is a prime.

It is a congruent number.

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

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

Almost surely, 21110010111111 is an apocalyptic number.

1110010111111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

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

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

The sum of its prime factors is 100910010112.

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

Adding to 1110010111111 its reverse (1111110100111), we get a palindrome (2221120211222).

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

Divisors: 1 11 100910010101 1110010111111