Base | Representation |
---|---|
bin | 11001001111100011100111… |
… | …100101110101001010110011 |
3 | 112120002102112122001200021011 |
4 | 121033203213211311022303 |
5 | 104022423332212333021 |
6 | 1032041550441011351 |
7 | 32245642024462636 |
oct | 3117434745651263 |
9 | 476072478050234 |
10 | 111020200121011 |
11 | 3241344774aa75 |
12 | 10550560483b57 |
13 | 49c421054200c |
14 | 1d5b599083c1d |
15 | cc7d54574de1 |
hex | 64f8e79752b3 |
111020200121011 has 2 divisors, whose sum is σ = 111020200121012. Its totient is φ = 111020200121010.
The previous prime is 111020200120933. The next prime is 111020200121041. The reversal of 111020200121011 is 110121002020111.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111020200121011 - 29 = 111020200120499 is a prime.
It is a super-3 number, since 3×1110202001210113 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111020200120982 and 111020200121000.
It is not a weakly prime, because it can be changed into another prime (111020200121041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55510100060505 + 55510100060506.
It is an arithmetic number, because the mean of its divisors is an integer number (55510100060506).
Almost surely, 2111020200121011 is an apocalyptic number.
111020200121011 is a deficient number, since it is larger than the sum of its proper divisors (1).
111020200121011 is an equidigital number, since it uses as much as digits as its factorization.
111020200121011 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 111020200121011 its reverse (110121002020111), we get a palindrome (221141202141122).
The spelling of 111020200121011 in words is "one hundred eleven trillion, twenty billion, two hundred million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •