Base | Representation |
---|---|
bin | 1001100011100000011010… |
… | …01000000001110001110001 |
3 | 2202101122120200002001221212 |
4 | 10301300031020001301301 |
5 | 10223221414224022043 |
6 | 112404225004125505 |
7 | 4266003062046224 |
oct | 461601510016161 |
9 | 82348520061855 |
10 | 21011200220273 |
11 | 677088884421a |
12 | 2434140536895 |
13 | b95469b0a543 |
14 | 528d39db35bb |
15 | 266839a3b018 |
hex | 131c0d201c71 |
21011200220273 has 2 divisors, whose sum is σ = 21011200220274. Its totient is φ = 21011200220272.
The previous prime is 21011200220209. The next prime is 21011200220281. The reversal of 21011200220273 is 37202200211012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16193034739249 + 4818165481024 = 4024057^2 + 2195032^2 .
It is a cyclic number.
It is not a de Polignac number, because 21011200220273 - 26 = 21011200220209 is a prime.
It is not a weakly prime, because it can be changed into another prime (21011200226273) 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, 10505600110136 + 10505600110137.
It is an arithmetic number, because the mean of its divisors is an integer number (10505600110137).
Almost surely, 221011200220273 is an apocalyptic number.
It is an amenable number.
21011200220273 is a deficient number, since it is larger than the sum of its proper divisors (1).
21011200220273 is an equidigital number, since it uses as much as digits as its factorization.
21011200220273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 23.
Adding to 21011200220273 its reverse (37202200211012), we get a palindrome (58213400431285).
The spelling of 21011200220273 in words is "twenty-one trillion, eleven billion, two hundred million, two hundred twenty thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •