Search a number
-
+
111112001111102 = 255556000555551
BaseRepresentation
bin11001010000111001000111…
…010110110100010000111110
3112120102012111101211011100012
4121100321013112310100332
5104030424334241023402
61032152052034503222
732255401653146315
oct3120710726642076
9476365441734305
10111112001111102
1132449375a41622
1210566300434b12
1349cca8050cbb4
141d61bc723527c
15cca428aa3452
hex650e475b443e

111112001111102 has 4 divisors (see below), whose sum is σ = 166668001666656. Its totient is φ = 55556000555550.

The previous prime is 111112001111093. The next prime is 111112001111107. The reversal of 111112001111102 is 201111100211111.

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 (111112001111107) 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, 27778000277774 + ... + 27778000277777.

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

Almost surely, 2111112001111102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 55556000555553.

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

Adding to 111112001111102 its reverse (201111100211111), we get a palindrome (312223101322213).

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

Divisors: 1 2 55556000555551 111112001111102