Base | Representation |
---|---|
bin | 1011111011001010101100… |
… | …1011001011100001001001 |
3 | 1201102102001221101002011212 |
4 | 2332302223023023201021 |
5 | 3204303024134201324 |
6 | 43515054532502505 |
7 | 2522150402245634 |
oct | 276625313134111 |
9 | 51372057332155 |
10 | 13111112022089 |
11 | 41a5433a26524 |
12 | 1579030a7aa35 |
13 | 7414ac685053 |
14 | 33481cb96c1b |
15 | 17b0b41dc70e |
hex | becab2cb849 |
13111112022089 has 2 divisors, whose sum is σ = 13111112022090. Its totient is φ = 13111112022088.
The previous prime is 13111112022059. The next prime is 13111112022121. The reversal of 13111112022089 is 98022021111131.
It is an a-pointer prime, because the next prime (13111112022121) can be obtained adding 13111112022089 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8597016892489 + 4514095129600 = 2932067^2 + 2124640^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13111112022089 is a prime.
It is not a weakly prime, because it can be changed into another prime (13111112022059) 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, 6555556011044 + 6555556011045.
It is an arithmetic number, because the mean of its divisors is an integer number (6555556011045).
Almost surely, 213111112022089 is an apocalyptic number.
It is an amenable number.
13111112022089 is a deficient number, since it is larger than the sum of its proper divisors (1).
13111112022089 is an equidigital number, since it uses as much as digits as its factorization.
13111112022089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 32.
The spelling of 13111112022089 in words is "thirteen trillion, one hundred eleven billion, one hundred twelve million, twenty-two thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •