Base | Representation |
---|---|
bin | 1001010001110110001010… |
… | …0101000100010100110011 |
3 | 1100010022122221111002210222 |
4 | 2110131202211010110303 |
5 | 2314123102002242321 |
6 | 33410454310443255 |
7 | 2102041025316521 |
oct | 224354245042463 |
9 | 40108587432728 |
10 | 10202201212211 |
11 | 3283802682568 |
12 | 118930866352b |
13 | 5900a9511a18 |
14 | 273b096c5311 |
15 | 12a5b17733ab |
hex | 94762944533 |
10202201212211 has 2 divisors, whose sum is σ = 10202201212212. Its totient is φ = 10202201212210.
The previous prime is 10202201212183. The next prime is 10202201212213. The reversal of 10202201212211 is 11221210220201.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10202201212211 is a prime.
Together with 10202201212213, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10202201212211.
It is not a weakly prime, because it can be changed into another prime (10202201212213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5101100606105 + 5101100606106.
It is an arithmetic number, because the mean of its divisors is an integer number (5101100606106).
Almost surely, 210202201212211 is an apocalyptic number.
10202201212211 is a deficient number, since it is larger than the sum of its proper divisors (1).
10202201212211 is an equidigital number, since it uses as much as digits as its factorization.
10202201212211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10202201212211 its reverse (11221210220201), we get a palindrome (21423411432412).
The spelling of 10202201212211 in words is "ten trillion, two hundred two billion, two hundred one million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •