Base | Representation |
---|---|
bin | 110111111011010100… |
… | …0110011110101100011 |
3 | 102111000010010021012102 |
4 | 1233312220303311203 |
5 | 3431432103311321 |
6 | 131101334521015 |
7 | 11451145146161 |
oct | 1576650636543 |
9 | 374003107172 |
10 | 120102010211 |
11 | 46a314a9987 |
12 | 1b339b0616b |
13 | b430382b41 |
14 | 5b54adc231 |
15 | 31cde05c0b |
hex | 1bf6a33d63 |
120102010211 has 2 divisors, whose sum is σ = 120102010212. Its totient is φ = 120102010210.
The previous prime is 120102010207. The next prime is 120102010253. The reversal of 120102010211 is 112010201021.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 120102010211 - 22 = 120102010207 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120102010192 and 120102010201.
It is not a weakly prime, because it can be changed into another prime (120102010291) 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, 60051005105 + 60051005106.
It is an arithmetic number, because the mean of its divisors is an integer number (60051005106).
Almost surely, 2120102010211 is an apocalyptic number.
120102010211 is a deficient number, since it is larger than the sum of its proper divisors (1).
120102010211 is an equidigital number, since it uses as much as digits as its factorization.
120102010211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 120102010211 its reverse (112010201021), we get a palindrome (232112211232).
The spelling of 120102010211 in words is "one hundred twenty billion, one hundred two million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •