Base | Representation |
---|---|
bin | 1100010011010001101… |
… | …1011011001110001001 |
3 | 202012111011022211202201 |
4 | 3010310123123032021 |
5 | 11430302222031441 |
6 | 241030211400201 |
7 | 21161012610343 |
oct | 3046433331611 |
9 | 665434284681 |
10 | 211333002121 |
11 | 81697a7445a |
12 | 34b5abb3061 |
13 | 16c0c22aba7 |
14 | a32b2b6293 |
15 | 576d390c31 |
hex | 31346db389 |
211333002121 has 2 divisors, whose sum is σ = 211333002122. Its totient is φ = 211333002120.
The previous prime is 211333002109. The next prime is 211333002143. The reversal of 211333002121 is 121200333112.
211333002121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 147456000000 + 63877002121 = 384000^2 + 252739^2 .
It is a cyclic number.
It is not a de Polignac number, because 211333002121 - 221 = 211330904969 is a prime.
It is not a weakly prime, because it can be changed into another prime (211333602121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105666501060 + 105666501061.
It is an arithmetic number, because the mean of its divisors is an integer number (105666501061).
Almost surely, 2211333002121 is an apocalyptic number.
It is an amenable number.
211333002121 is a deficient number, since it is larger than the sum of its proper divisors (1).
211333002121 is an equidigital number, since it uses as much as digits as its factorization.
211333002121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 211333002121 its reverse (121200333112), we get a palindrome (332533335233).
The spelling of 211333002121 in words is "two hundred eleven billion, three hundred thirty-three million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •