Base | Representation |
---|---|
bin | 100000000101001000100… |
… | …011100111110000000101 |
3 | 21210202021212111211121101 |
4 | 200011020203213300011 |
5 | 242104342043122021 |
6 | 4404425531020101 |
7 | 315162305512144 |
oct | 40051043476005 |
9 | 7722255454541 |
10 | 2204535520261 |
11 | 77aa35913538 |
12 | 2b730659a631 |
13 | 12cb6b415839 |
14 | 789b308575b |
15 | 3c529709a91 |
hex | 201488e7c05 |
2204535520261 has 2 divisors, whose sum is σ = 2204535520262. Its totient is φ = 2204535520260.
The previous prime is 2204535520249. The next prime is 2204535520273. The reversal of 2204535520261 is 1620255354022.
It is a balanced prime because it is at equal distance from previous prime (2204535520249) and next prime (2204535520273).
It can be written as a sum of positive squares in only one way, i.e., 2190918030625 + 13617489636 = 1480175^2 + 116694^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2204535520261 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2204535520261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2204535520661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1102267760130 + 1102267760131.
It is an arithmetic number, because the mean of its divisors is an integer number (1102267760131).
Almost surely, 22204535520261 is an apocalyptic number.
It is an amenable number.
2204535520261 is a deficient number, since it is larger than the sum of its proper divisors (1).
2204535520261 is an equidigital number, since it uses as much as digits as its factorization.
2204535520261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144000, while the sum is 37.
The spelling of 2204535520261 in words is "two trillion, two hundred four billion, five hundred thirty-five million, five hundred twenty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •