Base | Representation |
---|---|
bin | 11001001111010000110100… |
… | …001010110101000110101011 |
3 | 112120000111102112212220100211 |
4 | 121033100310022311012223 |
5 | 104022111010033131021 |
6 | 1032024411201441551 |
7 | 32244325503643003 |
oct | 3117206412650653 |
9 | 476014375786324 |
10 | 111000010052011 |
11 | 32405926a01333 |
12 | 105486669402b7 |
13 | 49c2343679422 |
14 | 1d5a601843003 |
15 | cc7571cb23e1 |
hex | 64f4342b51ab |
111000010052011 has 2 divisors, whose sum is σ = 111000010052012. Its totient is φ = 111000010052010.
The previous prime is 111000010051969. The next prime is 111000010052039. The reversal of 111000010052011 is 110250010000111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111000010052011 - 27 = 111000010051883 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111000010051982 and 111000010052000.
It is not a weakly prime, because it can be changed into another prime (111000013052011) 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, 55500005026005 + 55500005026006.
It is an arithmetic number, because the mean of its divisors is an integer number (55500005026006).
Almost surely, 2111000010052011 is an apocalyptic number.
111000010052011 is a deficient number, since it is larger than the sum of its proper divisors (1).
111000010052011 is an equidigital number, since it uses as much as digits as its factorization.
111000010052011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10, while the sum is 13.
Adding to 111000010052011 its reverse (110250010000111), we get a palindrome (221250020052122).
The spelling of 111000010052011 in words is "one hundred eleven trillion, ten million, fifty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •