Base | Representation |
---|---|
bin | 1010000001011101000110… |
… | …1111100100001001011011 |
3 | 1110000111211102012121021211 |
4 | 2200113101233210021123 |
5 | 2421023141131134321 |
6 | 35234322455043551 |
7 | 2215114412430634 |
oct | 240272157441133 |
9 | 43014742177254 |
10 | 11020110021211 |
11 | 35696698a4555 |
12 | 129b9306705b7 |
13 | 61c2658408a5 |
14 | 2a153a2da88b |
15 | 1419d1e090e1 |
hex | a05d1be425b |
11020110021211 has 2 divisors, whose sum is σ = 11020110021212. Its totient is φ = 11020110021210.
The previous prime is 11020110021203. The next prime is 11020110021251. The reversal of 11020110021211 is 11212001102011.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11020110021211 - 23 = 11020110021203 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11020110021191 and 11020110021200.
It is not a weakly prime, because it can be changed into another prime (11020110021251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510055010605 + 5510055010606.
It is an arithmetic number, because the mean of its divisors is an integer number (5510055010606).
Almost surely, 211020110021211 is an apocalyptic number.
11020110021211 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020110021211 is an equidigital number, since it uses as much as digits as its factorization.
11020110021211 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 11020110021211 its reverse (11212001102011), we get a palindrome (22232111123222).
The spelling of 11020110021211 in words is "eleven trillion, twenty billion, one hundred ten million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •