Base | Representation |
---|---|
bin | 1010000010110100110011… |
… | …1001101010010111010001 |
3 | 1110002202121000220102101212 |
4 | 2200231030321222113101 |
5 | 2421414344140232121 |
6 | 35253214442105505 |
7 | 2216606653343666 |
oct | 240551471522721 |
9 | 43082530812355 |
10 | 11043651102161 |
11 | 357864a15a057 |
12 | 12a44004ab295 |
13 | 621547a396a2 |
14 | 2a27309d5a6d |
15 | 14240d99925b |
hex | a0b4ce6a5d1 |
11043651102161 has 2 divisors, whose sum is σ = 11043651102162. Its totient is φ = 11043651102160.
The previous prime is 11043651102137. The next prime is 11043651102173. The reversal of 11043651102161 is 16120115634011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6359374368400 + 4684276733761 = 2521780^2 + 2164319^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11043651102161 is a prime.
It is not a weakly prime, because it can be changed into another prime (11043651102061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5521825551080 + 5521825551081.
It is an arithmetic number, because the mean of its divisors is an integer number (5521825551081).
Almost surely, 211043651102161 is an apocalyptic number.
It is an amenable number.
11043651102161 is a deficient number, since it is larger than the sum of its proper divisors (1).
11043651102161 is an equidigital number, since it uses as much as digits as its factorization.
11043651102161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 32.
Adding to 11043651102161 its reverse (16120115634011), we get a palindrome (27163766736172).
The spelling of 11043651102161 in words is "eleven trillion, forty-three billion, six hundred fifty-one million, one hundred two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •