Base | Representation |
---|---|
bin | 1100010010100010000… |
… | …1101000010100001111 |
3 | 202011222020120000202002 |
4 | 3010220201220110033 |
5 | 11424400111131111 |
6 | 240554315222515 |
7 | 21153036312341 |
oct | 3045041502417 |
9 | 664866500662 |
10 | 211133302031 |
11 | 815a5276863 |
12 | 34b04147a3b |
13 | 16ba9a4a262 |
14 | a30c971291 |
15 | 575aa9563b |
hex | 312886850f |
211133302031 has 2 divisors, whose sum is σ = 211133302032. Its totient is φ = 211133302030.
The previous prime is 211133302019. The next prime is 211133302043. The reversal of 211133302031 is 130203331112.
It is a balanced prime because it is at equal distance from previous prime (211133302019) and next prime (211133302043).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211133302031 is a prime.
It is a super-2 number, since 2×2111333020312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 211133301994 and 211133302012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211133302531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105566651015 + 105566651016.
It is an arithmetic number, because the mean of its divisors is an integer number (105566651016).
Almost surely, 2211133302031 is an apocalyptic number.
211133302031 is a deficient number, since it is larger than the sum of its proper divisors (1).
211133302031 is an equidigital number, since it uses as much as digits as its factorization.
211133302031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 211133302031 its reverse (130203331112), we get a palindrome (341336633143).
The spelling of 211133302031 in words is "two hundred eleven billion, one hundred thirty-three million, three hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.461 sec. • engine limits •