Base | Representation |
---|---|
bin | 101101100001011100001011… |
… | …111001011110111000010111 |
3 | 222020212220021010002001112111 |
4 | 231201130023321132320113 |
5 | 202220220241112333421 |
6 | 1545451130020131451 |
7 | 60112462631011663 |
oct | 5541341371367027 |
9 | 866786233061474 |
10 | 200210100121111 |
11 | 5887a699062a83 |
12 | 1a556085536b87 |
13 | 8793967c52182 |
14 | 376231328b8a3 |
15 | 1822dce09bee1 |
hex | b6170be5ee17 |
200210100121111 has 2 divisors, whose sum is σ = 200210100121112. Its totient is φ = 200210100121110.
The previous prime is 200210100121099. The next prime is 200210100121169. The reversal of 200210100121111 is 111121001012002.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200210100121111 - 219 = 200210099596823 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200210100121091 and 200210100121100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200210100121411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105050060555 + 100105050060556.
It is an arithmetic number, because the mean of its divisors is an integer number (100105050060556).
Almost surely, 2200210100121111 is an apocalyptic number.
200210100121111 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210100121111 is an equidigital number, since it uses as much as digits as its factorization.
200210100121111 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 13.
Adding to 200210100121111 its reverse (111121001012002), we get a palindrome (311331101133113).
The spelling of 200210100121111 in words is "two hundred trillion, two hundred ten billion, one hundred million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •