Base | Representation |
---|---|
bin | 101111111110111010000111… |
… | …110010010011100010000111 |
3 | 1000200012101102020220121012012 |
4 | 233332322013302103202013 |
5 | 210130013400003424111 |
6 | 2024454221231444435 |
7 | 62310333615562124 |
oct | 5776720762234207 |
9 | 1020171366817165 |
10 | 211031201233031 |
11 | 61271914584463 |
12 | 1b80331638671b |
13 | 909a2068b17aa |
14 | 3a17d70d7574b |
15 | 195e614a5348b |
hex | bfee87c93887 |
211031201233031 has 2 divisors, whose sum is σ = 211031201233032. Its totient is φ = 211031201233030.
The previous prime is 211031201232989. The next prime is 211031201233043. The reversal of 211031201233031 is 130332102130112.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211031201233031 is a prime.
It is a super-2 number, since 2×2110312012330312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211031201232988 and 211031201233006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211031201233081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105515600616515 + 105515600616516.
It is an arithmetic number, because the mean of its divisors is an integer number (105515600616516).
Almost surely, 2211031201233031 is an apocalyptic number.
211031201233031 is a deficient number, since it is larger than the sum of its proper divisors (1).
211031201233031 is an equidigital number, since it uses as much as digits as its factorization.
211031201233031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 211031201233031 its reverse (130332102130112), we get a palindrome (341363303363143).
The spelling of 211031201233031 in words is "two hundred eleven trillion, thirty-one billion, two hundred one million, two hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •