Base | Representation |
---|---|
bin | 10111000000110101001101… |
… | …010010110010101110000011 |
3 | 111021100210101022112211222122 |
4 | 113000311031102302232003 |
5 | 101231230041440232321 |
6 | 555132124315154455 |
7 | 30214224460406663 |
oct | 2700651522625603 |
9 | 437323338484878 |
10 | 101212201102211 |
11 | 2a281942a1aa11 |
12 | b427729445a2b |
13 | 4462367447354 |
14 | 1adc9a79461a3 |
15 | ba7b657018ab |
hex | 5c0d4d4b2b83 |
101212201102211 has 2 divisors, whose sum is σ = 101212201102212. Its totient is φ = 101212201102210.
The previous prime is 101212201102121. The next prime is 101212201102219. The reversal of 101212201102211 is 112201102212101.
Together with previous prime (101212201102121) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101212201102211 - 218 = 101212200840067 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101212201102211.
It is not a weakly prime, because it can be changed into another prime (101212201102219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50606100551105 + 50606100551106.
It is an arithmetic number, because the mean of its divisors is an integer number (50606100551106).
Almost surely, 2101212201102211 is an apocalyptic number.
101212201102211 is a deficient number, since it is larger than the sum of its proper divisors (1).
101212201102211 is an equidigital number, since it uses as much as digits as its factorization.
101212201102211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 101212201102211 its reverse (112201102212101), we get a palindrome (213413303314312).
The spelling of 101212201102211 in words is "one hundred one trillion, two hundred twelve billion, two hundred one million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •