Base | Representation |
---|---|
bin | 11001010010001011010001… |
… | …100111100011100110010011 |
3 | 112120201122012112102011220211 |
4 | 121102023101213203212103 |
5 | 104033401022321213021 |
6 | 1032300401553544551 |
7 | 32264644055166526 |
oct | 3122132147434623 |
9 | 476648175364824 |
10 | 111200220101011 |
11 | 32482826299448 |
12 | 1057b420875157 |
13 | 4a0819c360842 |
14 | 1d661957a0bbd |
15 | ccc88d8c83e1 |
hex | 6522d19e3993 |
111200220101011 has 2 divisors, whose sum is σ = 111200220101012. Its totient is φ = 111200220101010.
The previous prime is 111200220100993. The next prime is 111200220101017. The reversal of 111200220101011 is 110101022002111.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111200220101011 - 29 = 111200220100499 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111200220100982 and 111200220101000.
It is not a weakly prime, because it can be changed into another prime (111200220101017) 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, 55600110050505 + 55600110050506.
It is an arithmetic number, because the mean of its divisors is an integer number (55600110050506).
Almost surely, 2111200220101011 is an apocalyptic number.
111200220101011 is a deficient number, since it is larger than the sum of its proper divisors (1).
111200220101011 is an equidigital number, since it uses as much as digits as its factorization.
111200220101011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 111200220101011 its reverse (110101022002111), we get a palindrome (221301242103122).
The spelling of 111200220101011 in words is "one hundred eleven trillion, two hundred billion, two hundred twenty million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •