Base | Representation |
---|---|
bin | 1010000110001110100101… |
… | …1000100100000000010001 |
3 | 1110022100111012120002212122 |
4 | 2201203221120210000101 |
5 | 2423344110410214441 |
6 | 35340123413104025 |
7 | 2224046442436226 |
oct | 241435130440021 |
9 | 43270435502778 |
10 | 11102111023121 |
11 | 35a0419271a18 |
12 | 12b37b6628015 |
13 | 626c033b0ab1 |
14 | 2a54b8b1194d |
15 | 143bd0dd734b |
hex | a18e9624011 |
11102111023121 has 2 divisors, whose sum is σ = 11102111023122. Its totient is φ = 11102111023120.
The previous prime is 11102111023109. The next prime is 11102111023153. The reversal of 11102111023121 is 12132011120111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10061076486400 + 1041034536721 = 3171920^2 + 1020311^2 .
It is a cyclic number.
It is not a de Polignac number, because 11102111023121 - 214 = 11102111006737 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11102111023121.
It is not a weakly prime, because it can be changed into another prime (11102111073121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551055511560 + 5551055511561.
It is an arithmetic number, because the mean of its divisors is an integer number (5551055511561).
Almost surely, 211102111023121 is an apocalyptic number.
It is an amenable number.
11102111023121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102111023121 is an equidigital number, since it uses as much as digits as its factorization.
11102111023121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 11102111023121 its reverse (12132011120111), we get a palindrome (23234122143232).
The spelling of 11102111023121 in words is "eleven trillion, one hundred two billion, one hundred eleven million, twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •