Base | Representation |
---|---|
bin | 1010000001011100101111… |
… | …1010000110100000101111 |
3 | 1110000111120120222201020011 |
4 | 2200113023322012200233 |
5 | 2421022441100320421 |
6 | 35234305040434051 |
7 | 2215112113326661 |
oct | 240271372064057 |
9 | 43014516881204 |
10 | 11020012120111 |
11 | 3569619606a55 |
12 | 129b903918927 |
13 | 61c24b483547 |
14 | 2a152b2d4531 |
15 | 1419c851b4e1 |
hex | a05cbe8682f |
11020012120111 has 2 divisors, whose sum is σ = 11020012120112. Its totient is φ = 11020012120110.
The previous prime is 11020012119989. The next prime is 11020012120121. The reversal of 11020012120111 is 11102121002011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11020012120111 - 229 = 11019475249199 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11020012120091 and 11020012120100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11020012120121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510006060055 + 5510006060056.
It is an arithmetic number, because the mean of its divisors is an integer number (5510006060056).
Almost surely, 211020012120111 is an apocalyptic number.
11020012120111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020012120111 is an equidigital number, since it uses as much as digits as its factorization.
11020012120111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11020012120111 its reverse (11102121002011), we get a palindrome (22122133122122).
The spelling of 11020012120111 in words is "eleven trillion, twenty billion, twelve million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •