Base | Representation |
---|---|
bin | 11110100100000100010… |
… | …011000011001100001011 |
3 | 21102210021021220020110121 |
4 | 132210010103003030023 |
5 | 233402414121013121 |
6 | 4244511500124111 |
7 | 304512444606013 |
oct | 36440423031413 |
9 | 7383237806417 |
10 | 2100311110411 |
11 | 73a811959828 |
12 | 29b079b36637 |
13 | 12309b6619c7 |
14 | 73926d76c43 |
15 | 399796bd141 |
hex | 1e9044c330b |
2100311110411 has 2 divisors, whose sum is σ = 2100311110412. Its totient is φ = 2100311110410.
The previous prime is 2100311110301. The next prime is 2100311110427. The reversal of 2100311110411 is 1140111130012.
It is an a-pointer prime, because the next prime (2100311110427) can be obtained adding 2100311110411 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2100311110411 - 27 = 2100311110283 is a prime.
It is a super-2 number, since 2×21003111104112 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2100311116411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050155555205 + 1050155555206.
It is an arithmetic number, because the mean of its divisors is an integer number (1050155555206).
Almost surely, 22100311110411 is an apocalyptic number.
2100311110411 is a deficient number, since it is larger than the sum of its proper divisors (1).
2100311110411 is an equidigital number, since it uses as much as digits as its factorization.
2100311110411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 2100311110411 its reverse (1140111130012), we get a palindrome (3240422240423).
The spelling of 2100311110411 in words is "two trillion, one hundred billion, three hundred eleven million, one hundred ten thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •