Base | Representation |
---|---|
bin | 1010000000010110010010… |
… | …1010100001000100000001 |
3 | 1102221200202120201011110002 |
4 | 2200011210222201010001 |
5 | 2420220223112042004 |
6 | 35221500254445345 |
7 | 2213542342034321 |
oct | 240054452410401 |
9 | 42850676634402 |
10 | 11001100112129 |
11 | 35615a4240496 |
12 | 1298106203855 |
13 | 61a526313a8a |
14 | 2a0655703281 |
15 | 14126d06361e |
hex | a0164aa1101 |
11001100112129 has 2 divisors, whose sum is σ = 11001100112130. Its totient is φ = 11001100112128.
The previous prime is 11001100112063. The next prime is 11001100112179. The reversal of 11001100112129 is 92121100110011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8726251884529 + 2274848227600 = 2954023^2 + 1508260^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11001100112129 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11001100112129.
It is not a weakly prime, because it can be changed into another prime (11001100112179) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500550056064 + 5500550056065.
It is an arithmetic number, because the mean of its divisors is an integer number (5500550056065).
Almost surely, 211001100112129 is an apocalyptic number.
It is an amenable number.
11001100112129 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001100112129 is an equidigital number, since it uses as much as digits as its factorization.
11001100112129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 11001100112129 in words is "eleven trillion, one billion, one hundred million, one hundred twelve thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •