Search a number
-
+
111100000010001 = 3193752678994789
BaseRepresentation
bin11001010000101101111100…
…000010001111111100010001
3112120101001112000122001120020
4121100231330002033330101
5104030230300000310001
61032142345125334053
732254465366365342
oct3120557402177421
9476331460561506
10111100000010001
11324442776a8752
1210563b11267329
1349cb8ba081142
141d613a940c0c9
15cc9e751b6736
hex650b7c08ff11

111100000010001 has 16 divisors (see below), whose sum is σ = 160144144161600. Its totient is φ = 68271977245248.

The previous prime is 111100000009997. The next prime is 111100000010017. The reversal of 111100000010001 is 100010000001111.

It is not a de Polignac number, because 111100000010001 - 22 = 111100000009997 is a prime.

It is not an unprimeable number, because it can be changed into a prime (111100000010101) 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 in 15 ways as a sum of consecutive naturals, for example, 26339495286 + ... + 26339499503.

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

Almost surely, 2111100000010001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 52678994848.

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

Adding to 111100000010001 its reverse (100010000001111), we get a palindrome (211110000011112).

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

Divisors: 1 3 19 37 57 111 703 2109 52678994789 158036984367 1000900900991 1949122807193 3002702702973 5847368421579 37033333336667 111100000010001