Base | Representation |
---|---|
bin | 1010000001011101000100… |
… | …1001011010111011111011 |
3 | 1110000111210201101120222002 |
4 | 2200113101021122323323 |
5 | 2421023131101201021 |
6 | 35234321500451215 |
7 | 2215114231433513 |
oct | 240272111327373 |
9 | 43014721346862 |
10 | 11020100022011 |
11 | 3569664194a53 |
12 | 129b929249b0b |
13 | 61c26374c4c2 |
14 | 2a1538c56843 |
15 | 1419d10d150b |
hex | a05d125aefb |
11020100022011 has 2 divisors, whose sum is σ = 11020100022012. Its totient is φ = 11020100022010.
The previous prime is 11020100021993. The next prime is 11020100022031. The reversal of 11020100022011 is 11022000102011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11020100022011 - 214 = 11020100005627 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11020100021983 and 11020100022001.
It is not a weakly prime, because it can be changed into another prime (11020100022031) 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, 5510050011005 + 5510050011006.
It is an arithmetic number, because the mean of its divisors is an integer number (5510050011006).
Almost surely, 211020100022011 is an apocalyptic number.
11020100022011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020100022011 is an equidigital number, since it uses as much as digits as its factorization.
11020100022011 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 11.
Adding to 11020100022011 its reverse (11022000102011), we get a palindrome (22042100124022).
The spelling of 11020100022011 in words is "eleven trillion, twenty billion, one hundred million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •