Base | Representation |
---|---|
bin | 100000000010110000111… |
… | …101100001010011100101 |
3 | 21210111201121202101202021 |
4 | 200002300331201103211 |
5 | 242034134444012043 |
6 | 4403325314143141 |
7 | 315042263433661 |
oct | 40026075412345 |
9 | 7714647671667 |
10 | 2201992172773 |
11 | 7799501a2968 |
12 | 2b6916881ab1 |
13 | 12c854519cb3 |
14 | 7881138d8a1 |
15 | 3c42b2ba3ed |
hex | 200b0f614e5 |
2201992172773 has 2 divisors, whose sum is σ = 2201992172774. Its totient is φ = 2201992172772.
The previous prime is 2201992172761. The next prime is 2201992172839. The reversal of 2201992172773 is 3772712991022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1583917897444 + 618074275329 = 1258538^2 + 786177^2 .
It is a cyclic number.
It is not a de Polignac number, because 2201992172773 - 237 = 2064553219301 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2201992172773.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2201992172713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100996086386 + 1100996086387.
It is an arithmetic number, because the mean of its divisors is an integer number (1100996086387).
Almost surely, 22201992172773 is an apocalyptic number.
It is an amenable number.
2201992172773 is a deficient number, since it is larger than the sum of its proper divisors (1).
2201992172773 is an equidigital number, since it uses as much as digits as its factorization.
2201992172773 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1333584, while the sum is 52.
The spelling of 2201992172773 in words is "two trillion, two hundred one billion, nine hundred ninety-two million, one hundred seventy-two thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •