Base | Representation |
---|---|
bin | 101101111110101100001001… |
… | …111001010010110111011101 |
3 | 222112000001110020120000110111 |
4 | 231332230021321102313131 |
5 | 203001133241432240442 |
6 | 1554030345301410021 |
7 | 60410630604253654 |
oct | 5576541171226735 |
9 | 875001406500414 |
10 | 202220111211997 |
11 | 59485081a0359a |
12 | 1a81b742109911 |
13 | 88ab375587c58 |
14 | 37d171154a19b |
15 | 185a320dc8b17 |
hex | b7eb09e52ddd |
202220111211997 has 2 divisors, whose sum is σ = 202220111211998. Its totient is φ = 202220111211996.
The previous prime is 202220111211941. The next prime is 202220111212003. The reversal of 202220111211997 is 799112111022202.
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., 186648358648761 + 15571752563236 = 13661931^2 + 3946106^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-202220111211997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202220111211907) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101110055605998 + 101110055605999.
It is an arithmetic number, because the mean of its divisors is an integer number (101110055605999).
Almost surely, 2202220111211997 is an apocalyptic number.
It is an amenable number.
202220111211997 is a deficient number, since it is larger than the sum of its proper divisors (1).
202220111211997 is an equidigital number, since it uses as much as digits as its factorization.
202220111211997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 40.
The spelling of 202220111211997 in words is "two hundred two trillion, two hundred twenty billion, one hundred eleven million, two hundred eleven thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •