Base | Representation |
---|---|
bin | 101101111101010000110010… |
… | …101011001011110101001101 |
3 | 222111122200020110221120102011 |
4 | 231331100302223023311031 |
5 | 202443031334322144323 |
6 | 1553513323044301221 |
7 | 60400555600320355 |
oct | 5575206253136515 |
9 | 874580213846364 |
10 | 202122011131213 |
11 | 59447510a78968 |
12 | 1a8047246a1811 |
13 | 88a2040581384 |
14 | 37caa86971b65 |
15 | 18579cd88320d |
hex | b7d432acbd4d |
202122011131213 has 2 divisors, whose sum is σ = 202122011131214. Its totient is φ = 202122011131212.
The previous prime is 202122011131193. The next prime is 202122011131223. The reversal of 202122011131213 is 312131110221202.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 175511703174889 + 26610307956324 = 13248083^2 + 5158518^2 .
It is a cyclic number.
It is not a de Polignac number, because 202122011131213 - 217 = 202122011000141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202122011131223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101061005565606 + 101061005565607.
It is an arithmetic number, because the mean of its divisors is an integer number (101061005565607).
Almost surely, 2202122011131213 is an apocalyptic number.
It is an amenable number.
202122011131213 is a deficient number, since it is larger than the sum of its proper divisors (1).
202122011131213 is an equidigital number, since it uses as much as digits as its factorization.
202122011131213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 202122011131213 its reverse (312131110221202), we get a palindrome (514253121352415).
The spelling of 202122011131213 in words is "two hundred two trillion, one hundred twenty-two billion, eleven million, one hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •