Base | Representation |
---|---|
bin | 1100011010101001011… |
… | …0000110111111011111 |
3 | 202101121000212210202102 |
4 | 3012222112012333133 |
5 | 11443330144220111 |
6 | 241554401515315 |
7 | 21261024206135 |
oct | 3065226067737 |
9 | 671530783672 |
10 | 213311320031 |
11 | 82512751a37 |
12 | 35411642b3b |
13 | 171660532c4 |
14 | a477d29755 |
15 | 5836dbe13b |
hex | 31aa586fdf |
213311320031 has 2 divisors, whose sum is σ = 213311320032. Its totient is φ = 213311320030.
The previous prime is 213311319979. The next prime is 213311320091. The reversal of 213311320031 is 130023113312.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213311320031 is a prime.
It is a super-2 number, since 2×2133113200312 (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 = 213311319985 and 213311320012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213311320091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106655660015 + 106655660016.
It is an arithmetic number, because the mean of its divisors is an integer number (106655660016).
Almost surely, 2213311320031 is an apocalyptic number.
213311320031 is a deficient number, since it is larger than the sum of its proper divisors (1).
213311320031 is an equidigital number, since it uses as much as digits as its factorization.
213311320031 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 213311320031 its reverse (130023113312), we get a palindrome (343334433343).
The spelling of 213311320031 in words is "two hundred thirteen billion, three hundred eleven million, three hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •