Base | Representation |
---|---|
bin | 11001001111100011011100… |
… | …110110101110100101001101 |
3 | 112120002102002002010122012101 |
4 | 121033203130312232211031 |
5 | 104022423000110013401 |
6 | 1032041520524235101 |
7 | 32245634406465001 |
oct | 3117433466564515 |
9 | 476072062118171 |
10 | 111020020001101 |
11 | 32413365006242 |
12 | 1055051009ba91 |
13 | 49c41b21286a3 |
14 | 1d5b57d198701 |
15 | cc7d43846101 |
hex | 64f8dcdae94d |
111020020001101 has 2 divisors, whose sum is σ = 111020020001102. Its totient is φ = 111020020001100.
The previous prime is 111020020001021. The next prime is 111020020001129. The reversal of 111020020001101 is 101100020020111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110790339438601 + 229680562500 = 10525699^2 + 479250^2 .
It is a cyclic number.
It is not a de Polignac number, because 111020020001101 - 229 = 111019483130189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111020020001131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55510010000550 + 55510010000551.
It is an arithmetic number, because the mean of its divisors is an integer number (55510010000551).
Almost surely, 2111020020001101 is an apocalyptic number.
It is an amenable number.
111020020001101 is a deficient number, since it is larger than the sum of its proper divisors (1).
111020020001101 is an equidigital number, since it uses as much as digits as its factorization.
111020020001101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 111020020001101 its reverse (101100020020111), we get a palindrome (212120040021212).
The spelling of 111020020001101 in words is "one hundred eleven trillion, twenty billion, twenty million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •