Base | Representation |
---|---|
bin | 11001001111100100100011… |
… | …110110110101010101010001 |
3 | 112120002112011002121101002211 |
4 | 121033210203312311111101 |
5 | 104022432420032223324 |
6 | 1032042235040112121 |
7 | 32246006052553264 |
oct | 3117444366652521 |
9 | 476075132541084 |
10 | 111021211211089 |
11 | 32413916458a03 |
12 | 105507a3005641 |
13 | 49c4341b62c7a |
14 | 1d5b65347acdb |
15 | cc7db31e7294 |
hex | 64f923db5551 |
111021211211089 has 2 divisors, whose sum is σ = 111021211211090. Its totient is φ = 111021211211088.
The previous prime is 111021211211087. The next prime is 111021211211107. The reversal of 111021211211089 is 980112112120111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64516108324864 + 46505102886225 = 8032192^2 + 6819465^2 .
It is a cyclic number.
It is not a de Polignac number, because 111021211211089 - 21 = 111021211211087 is a prime.
Together with 111021211211087, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 111021211211089.
It is not a weakly prime, because it can be changed into another prime (111021211211087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55510605605544 + 55510605605545.
It is an arithmetic number, because the mean of its divisors is an integer number (55510605605545).
Almost surely, 2111021211211089 is an apocalyptic number.
It is an amenable number.
111021211211089 is a deficient number, since it is larger than the sum of its proper divisors (1).
111021211211089 is an equidigital number, since it uses as much as digits as its factorization.
111021211211089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 31.
The spelling of 111021211211089 in words is "one hundred eleven trillion, twenty-one billion, two hundred eleven million, two hundred eleven thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •