Search a number
-
+
111110000101069 is a prime number
BaseRepresentation
bin11001010000110111010000…
…000101100100011011001101
3112120102000022221120022121111
4121100313100011210123031
5104030411240011213234
61032151121314132021
732255301244636654
oct3120672005443315
9476360287508544
10111110000101069
1132448539475122
1210565a42281011
1349cc821aa0ba8
141d61a7759619b
15cca35d091664
hex650dd01646cd

111110000101069 has 2 divisors, whose sum is σ = 111110000101070. Its totient is φ = 111110000101068.

The previous prime is 111110000101049. The next prime is 111110000101109. The reversal of 111110000101069 is 960101000011111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 69422807241225 + 41687192859844 = 8332035^2 + 6456562^2 .

It is a cyclic number.

It is not a de Polignac number, because 111110000101069 - 27 = 111110000100941 is a prime.

It is a super-2 number, since 2×1111100001010692 (a number of 29 digits) contains 22 as substring.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (111110000101049) by changing a digit.

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

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

Almost surely, 2111110000101069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 54, while the sum is 22.

The spelling of 111110000101069 in words is "one hundred eleven trillion, one hundred ten billion, one hundred one thousand, sixty-nine".