Base | Representation |
---|---|
bin | 1100001111000110010… |
… | …0001000101101011001 |
3 | 202002120222111000011221 |
4 | 3003301210020231121 |
5 | 11421003032241441 |
6 | 240323015452041 |
7 | 21121141551511 |
oct | 3036144105531 |
9 | 662528430157 |
10 | 210211212121 |
11 | 81171826a89 |
12 | 348a7387021 |
13 | 16a909bb121 |
14 | a262304841 |
15 | 5704b538d1 |
hex | 30f1908b59 |
210211212121 has 2 divisors, whose sum is σ = 210211212122. Its totient is φ = 210211212120.
The previous prime is 210211212097. The next prime is 210211212143. The reversal of 210211212121 is 121212112012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 149073210000 + 61138002121 = 386100^2 + 247261^2 .
It is a cyclic number.
It is not a de Polignac number, because 210211212121 - 27 = 210211211993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210211212095 and 210211212104.
It is not a weakly prime, because it can be changed into another prime (210211212721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105105606060 + 105105606061.
It is an arithmetic number, because the mean of its divisors is an integer number (105105606061).
Almost surely, 2210211212121 is an apocalyptic number.
It is an amenable number.
210211212121 is a deficient number, since it is larger than the sum of its proper divisors (1).
210211212121 is an equidigital number, since it uses as much as digits as its factorization.
210211212121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 210211212121 its reverse (121212112012), we get a palindrome (331423324133).
The spelling of 210211212121 in words is "two hundred ten billion, two hundred eleven million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •