Base | Representation |
---|---|
bin | 101101111110101100001001… |
… | …010010110001000010111101 |
3 | 222112000001102112112212212102 |
4 | 231332230021102301002331 |
5 | 203001133231341040442 |
6 | 1554030344301114445 |
7 | 60410630422356623 |
oct | 5576541122610275 |
9 | 875001375485772 |
10 | 202220101111997 |
11 | 59485077235291 |
12 | 1a81b73a858a25 |
13 | 88ab37345ca17 |
14 | 37d171007b513 |
15 | 185a320081232 |
hex | b7eb094b10bd |
202220101111997 has 2 divisors, whose sum is σ = 202220101111998. Its totient is φ = 202220101111996.
The previous prime is 202220101111949. The next prime is 202220101112063. The reversal of 202220101111997 is 799111101022202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 164709143216836 + 37510957895161 = 12833906^2 + 6124619^2 .
It is a cyclic number.
It is not a de Polignac number, because 202220101111997 - 26 = 202220101111933 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 202220101111997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202220101111907) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101110050555998 + 101110050555999.
It is an arithmetic number, because the mean of its divisors is an integer number (101110050555999).
Almost surely, 2202220101111997 is an apocalyptic number.
It is an amenable number.
202220101111997 is a deficient number, since it is larger than the sum of its proper divisors (1).
202220101111997 is an equidigital number, since it uses as much as digits as its factorization.
202220101111997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 38.
The spelling of 202220101111997 in words is "two hundred two trillion, two hundred twenty billion, one hundred one million, one hundred eleven thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •