Base | Representation |
---|---|
bin | 101111110001101011011110… |
… | …011000110011111100110111 |
3 | 1000112222110220220021000121122 |
4 | 233301223132120303330313 |
5 | 210020120101000213421 |
6 | 2022520434141334155 |
7 | 62154552020134562 |
oct | 5761533630637467 |
9 | 1015873826230548 |
10 | 210122121101111 |
11 | 60a5132254210a |
12 | 1b6970a926735b |
13 | 903257ab99c7b |
14 | 39c5d71a794d9 |
15 | 1945b5a2bc2ab |
hex | bf1ade633f37 |
210122121101111 has 2 divisors, whose sum is σ = 210122121101112. Its totient is φ = 210122121101110.
The previous prime is 210122121101069. The next prime is 210122121101129. The reversal of 210122121101111 is 111101121221012.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 210122121101111 - 26 = 210122121101047 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210122121101111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210122121101161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105061060550555 + 105061060550556.
It is an arithmetic number, because the mean of its divisors is an integer number (105061060550556).
Almost surely, 2210122121101111 is an apocalyptic number.
210122121101111 is a deficient number, since it is larger than the sum of its proper divisors (1).
210122121101111 is an equidigital number, since it uses as much as digits as its factorization.
210122121101111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 210122121101111 its reverse (111101121221012), we get a palindrome (321223242322123).
The spelling of 210122121101111 in words is "two hundred ten trillion, one hundred twenty-two billion, one hundred twenty-one million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •