Base | Representation |
---|---|
bin | 101111111110101111110010… |
… | …000111001110101010010111 |
3 | 1000200011022202121100202012211 |
4 | 233332233302013032222113 |
5 | 210124323131122413421 |
6 | 2024445143514054251 |
7 | 62306461541425435 |
oct | 5776576207165227 |
9 | 1020138677322184 |
10 | 211020100201111 |
11 | 6126813830a913 |
12 | 1b80113871a387 |
13 | 9099157a71a56 |
14 | 3a175da8c5d55 |
15 | 195e1b51a89e1 |
hex | bfebf21cea97 |
211020100201111 has 2 divisors, whose sum is σ = 211020100201112. Its totient is φ = 211020100201110.
The previous prime is 211020100201093. The next prime is 211020100201177. The reversal of 211020100201111 is 111102001020112.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 211020100201111 - 219 = 211020099676823 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 211020100201091 and 211020100201100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211020100001111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105510050100555 + 105510050100556.
It is an arithmetic number, because the mean of its divisors is an integer number (105510050100556).
Almost surely, 2211020100201111 is an apocalyptic number.
211020100201111 is a deficient number, since it is larger than the sum of its proper divisors (1).
211020100201111 is an equidigital number, since it uses as much as digits as its factorization.
211020100201111 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 211020100201111 its reverse (111102001020112), we get a palindrome (322122101221223).
The spelling of 211020100201111 in words is "two hundred eleven trillion, twenty billion, one hundred million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •