Base | Representation |
---|---|
bin | 11001000010001100101011… |
… | …001011001111111010011011 |
3 | 112102211200001101120122221011 |
4 | 121002030223023033322123 |
5 | 103412403312004031021 |
6 | 1030100131340154351 |
7 | 32122423266636214 |
oct | 3102145313177233 |
9 | 472750041518834 |
10 | 110102211002011 |
11 | 3209a0a382a888 |
12 | 104226678389b7 |
13 | 4958794b951c7 |
14 | 1d28d928a440b |
15 | cae027addde1 |
hex | 64232b2cfe9b |
110102211002011 has 2 divisors, whose sum is σ = 110102211002012. Its totient is φ = 110102211002010.
The previous prime is 110102211001933. The next prime is 110102211002039. The reversal of 110102211002011 is 110200112201011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110102211002011 - 27 = 110102211001883 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110102211001982 and 110102211002000.
It is not a weakly prime, because it can be changed into another prime (110102211002071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55051105501005 + 55051105501006.
It is an arithmetic number, because the mean of its divisors is an integer number (55051105501006).
Almost surely, 2110102211002011 is an apocalyptic number.
110102211002011 is a deficient number, since it is larger than the sum of its proper divisors (1).
110102211002011 is an equidigital number, since it uses as much as digits as its factorization.
110102211002011 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 110102211002011 its reverse (110200112201011), we get a palindrome (220302323203022).
The spelling of 110102211002011 in words is "one hundred ten trillion, one hundred two billion, two hundred eleven million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •