Search a number
-
+
111110201112112 = 246944387569507
BaseRepresentation
bin11001010000110111011100…
…000100010111011000110000
3112120102000211221210201220221
4121100313130010113120300
5104030412142441041422
61032151153254342424
732255306235334666
oct3120673404273060
9476360757721827
10111110201112112
1132448631988754
1210565a9965aa14
1349cc854620437
141d61a9615cc36
15cca370a4a3c7
hex650ddc117630

111110201112112 has 10 divisors (see below), whose sum is σ = 215276014654748. Its totient is φ = 55555100556048.

The previous prime is 111110201112067. The next prime is 111110201112193. The reversal of 111110201112112 is 211211102011111.

It is a Harshad number since it is a multiple of its sum of digits (16), and also a Moran number because the ratio is a prime number: 6944387569507 = 111110201112112 / (1 + 1 + 1 + 1 + 1 + 0 + 2 + 0 + 1 + 1 + 1 + 2 + 1 + 1 + 2).

It is an unprimeable number.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3472193784738 + ... + 3472193784769.

Almost surely, 2111110201112112 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6944387569515 (or 6944387569509 counting only the distinct ones).

The product of its (nonzero) digits is 8, while the sum is 16.

Adding to 111110201112112 its reverse (211211102011111), we get a palindrome (322321303123223).

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

Divisors: 1 2 4 8 16 6944387569507 13888775139014 27777550278028 55555100556056 111110201112112