Base | Representation |
---|---|
bin | 11101011011010100110… |
… | …00110101110000110001 |
3 | 10120122211110012012000112 |
4 | 32231222120311300301 |
5 | 113031214131223441 |
6 | 2052254405231105 |
7 | 133023024663332 |
oct | 16555230656061 |
9 | 3518743165015 |
10 | 1011102211121 |
11 | 35a895925492 |
12 | 143b60102495 |
13 | 7446742c232 |
14 | 36d1ab22289 |
15 | 1b47b2954eb |
hex | eb6a635c31 |
1011102211121 has 2 divisors, whose sum is σ = 1011102211122. Its totient is φ = 1011102211120.
The previous prime is 1011102211111. The next prime is 1011102211139. The reversal of 1011102211121 is 1211122011101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 931541546896 + 79560664225 = 965164^2 + 282065^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011102211121 - 26 = 1011102211057 is a prime.
It is a super-3 number, since 3×10111022111213 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1011102211096 and 1011102211105.
It is not a weakly prime, because it can be changed into another prime (1011102211111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505551105560 + 505551105561.
It is an arithmetic number, because the mean of its divisors is an integer number (505551105561).
Almost surely, 21011102211121 is an apocalyptic number.
It is an amenable number.
1011102211121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011102211121 is an equidigital number, since it uses as much as digits as its factorization.
1011102211121 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 14.
Adding to 1011102211121 its reverse (1211122011101), we get a palindrome (2222224222222).
The spelling of 1011102211121 in words is "one trillion, eleven billion, one hundred two million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •