Search a number
-
+
1110121111102 = 2555060555551
BaseRepresentation
bin10000001001111000010…
…111111101111000111110
310221010102020201111001111
4100021320113331320332
5121142012001023402
62205552124032234
7143126556516043
oct20117027757076
93833366644044
101110121111102
11398888476623
1215b19539267a
13808b78bb303
143ba317551ca
151dd242d39d7
hex102785fde3e

1110121111102 has 4 divisors (see below), whose sum is σ = 1665181666656. Its totient is φ = 555060555550.

The previous prime is 1110121111091. The next prime is 1110121111103. The reversal of 1110121111102 is 2011111210111.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1110121111103) 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 as a sum of consecutive naturals, namely, 277530277774 + ... + 277530277777.

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

Almost surely, 21110121111102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 555060555553.

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

Adding to 1110121111102 its reverse (2011111210111), we get a palindrome (3121232321213).

Subtracting 1110121111102 from its reverse (2011111210111), we obtain a palindrome (900990099009).

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

Divisors: 1 2 555060555551 1110121111102