Base | Representation |
---|---|
bin | 1010000110001110101000… |
… | …0010011100001001110011 |
3 | 1110022100111222012211201011 |
4 | 2201203222002130021303 |
5 | 2423344121213013021 |
6 | 35340124444251351 |
7 | 2224046634650566 |
oct | 241435202341163 |
9 | 43270458184634 |
10 | 11102122001011 |
11 | 35a042448a858 |
12 | 12b37ba240b57 |
13 | 626c057557a2 |
14 | 2a54ba36c4dd |
15 | 143bd1d54de1 |
hex | a18ea09c273 |
11102122001011 has 2 divisors, whose sum is σ = 11102122001012. Its totient is φ = 11102122001010.
The previous prime is 11102122000967. The next prime is 11102122001141. The reversal of 11102122001011 is 11010022120111.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11102122001011 is a prime.
It is a super-2 number, since 2×111021220010112 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11102122000982 and 11102122001000.
It is not a weakly prime, because it can be changed into another prime (11102122008011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551061000505 + 5551061000506.
It is an arithmetic number, because the mean of its divisors is an integer number (5551061000506).
Almost surely, 211102122001011 is an apocalyptic number.
11102122001011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102122001011 is an equidigital number, since it uses as much as digits as its factorization.
11102122001011 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 11102122001011 its reverse (11010022120111), we get a palindrome (22112144121122).
The spelling of 11102122001011 in words is "eleven trillion, one hundred two billion, one hundred twenty-two million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •