Base | Representation |
---|---|
bin | 1010000000110111011111… |
… | …0011010100011000111011 |
3 | 1102222112202121100022212111 |
4 | 2200031313303110120323 |
5 | 2420342000321334321 |
6 | 35225532420353151 |
7 | 2214306224254534 |
oct | 240156763243073 |
9 | 42875677308774 |
10 | 11010011121211 |
11 | 356535727a503 |
12 | 12999925457b7 |
13 | 61b31650650b |
14 | 2a0c5cd9168b |
15 | 1415e05125e1 |
hex | a0377cd463b |
11010011121211 has 2 divisors, whose sum is σ = 11010011121212. Its totient is φ = 11010011121210.
The previous prime is 11010011121157. The next prime is 11010011121251. The reversal of 11010011121211 is 11212111001011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11010011121211 - 213 = 11010011113019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11010011121191 and 11010011121200.
It is not a weakly prime, because it can be changed into another prime (11010011121251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505005560605 + 5505005560606.
It is an arithmetic number, because the mean of its divisors is an integer number (5505005560606).
Almost surely, 211010011121211 is an apocalyptic number.
11010011121211 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010011121211 is an equidigital number, since it uses as much as digits as its factorization.
11010011121211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11010011121211 its reverse (11212111001011), we get a palindrome (22222122122222).
The spelling of 11010011121211 in words is "eleven trillion, ten billion, eleven million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •