Base | Representation |
---|---|
bin | 100000000011010010110… |
… | …101111100011010001101 |
3 | 21210120012020101002202021 |
4 | 200003102311330122031 |
5 | 242041321004040411 |
6 | 4403501541530141 |
7 | 315062335204102 |
oct | 40032265743215 |
9 | 7716166332667 |
10 | 2202560611981 |
11 | 77a112054734 |
12 | 2b6a55113951 |
13 | 12c915215362 |
14 | 78866a7caa9 |
15 | 3c461151a71 |
hex | 200d2d7c68d |
2202560611981 has 2 divisors, whose sum is σ = 2202560611982. Its totient is φ = 2202560611980.
The previous prime is 2202560611973. The next prime is 2202560612009. The reversal of 2202560611981 is 1891160652022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2152869514756 + 49691097225 = 1467266^2 + 222915^2 .
It is a cyclic number.
It is not a de Polignac number, because 2202560611981 - 23 = 2202560611973 is a prime.
It is a super-2 number, since 2×22025606119812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2202560621981) 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, 1101280305990 + 1101280305991.
It is an arithmetic number, because the mean of its divisors is an integer number (1101280305991).
Almost surely, 22202560611981 is an apocalyptic number.
It is an amenable number.
2202560611981 is a deficient number, since it is larger than the sum of its proper divisors (1).
2202560611981 is an equidigital number, since it uses as much as digits as its factorization.
2202560611981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 103680, while the sum is 43.
The spelling of 2202560611981 in words is "two trillion, two hundred two billion, five hundred sixty million, six hundred eleven thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •