Base | Representation |
---|---|
bin | 10001100111000110101… |
… | …111010011101001110011 |
3 | 11021200210022121222211111 |
4 | 101213012233103221303 |
5 | 124312012321201321 |
6 | 2323544544454151 |
7 | 153302245056403 |
oct | 21470657235163 |
9 | 4250708558744 |
10 | 1210220100211 |
11 | 427284772701 |
12 | 17667031a357 |
13 | 8a17aa79395 |
14 | 428099c2803 |
15 | 217320735e1 |
hex | 119c6bd3a73 |
1210220100211 has 2 divisors, whose sum is σ = 1210220100212. Its totient is φ = 1210220100210.
The previous prime is 1210220100161. The next prime is 1210220100217. The reversal of 1210220100211 is 1120010220121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1210220100211 - 217 = 1210219969139 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1210220100191 and 1210220100200.
It is not a weakly prime, because it can be changed into another prime (1210220100217) 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, 605110050105 + 605110050106.
It is an arithmetic number, because the mean of its divisors is an integer number (605110050106).
Almost surely, 21210220100211 is an apocalyptic number.
1210220100211 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210220100211 is an equidigital number, since it uses as much as digits as its factorization.
1210220100211 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 13.
Adding to 1210220100211 its reverse (1120010220121), we get a palindrome (2330230320332).
The spelling of 1210220100211 in words is "one trillion, two hundred ten billion, two hundred twenty million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •