Base | Representation |
---|---|
bin | 1100010011001100110… |
… | …0000111110000101001 |
3 | 202012102201012122111111 |
4 | 3010303030013300221 |
5 | 11430231411304113 |
6 | 241024150030321 |
7 | 21160341113635 |
oct | 3046314076051 |
9 | 665381178444 |
10 | 211312213033 |
11 | 81687265299 |
12 | 34b540483a1 |
13 | 16c07b2c55c |
14 | a328623dc5 |
15 | 576b63613d |
hex | 3133307c29 |
211312213033 has 2 divisors, whose sum is σ = 211312213034. Its totient is φ = 211312213032.
The previous prime is 211312213019. The next prime is 211312213061. The reversal of 211312213033 is 330312213112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119568649369 + 91743563664 = 345787^2 + 302892^2 .
It is a cyclic number.
It is not a de Polignac number, because 211312213033 - 25 = 211312213001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 211312212995 and 211312213013.
It is not a weakly prime, because it can be changed into another prime (211312213933) 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, 105656106516 + 105656106517.
It is an arithmetic number, because the mean of its divisors is an integer number (105656106517).
Almost surely, 2211312213033 is an apocalyptic number.
It is an amenable number.
211312213033 is a deficient number, since it is larger than the sum of its proper divisors (1).
211312213033 is an equidigital number, since it uses as much as digits as its factorization.
211312213033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 211312213033 its reverse (330312213112), we get a palindrome (541624426145).
The spelling of 211312213033 in words is "two hundred eleven billion, three hundred twelve million, two hundred thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •