Base | Representation |
---|---|
bin | 1001101001101001011100… |
… | …10110010100000111110101 |
3 | 2210010211020101002212212111 |
4 | 10310310232112110013311 |
5 | 10240201042004323221 |
6 | 113045203225451021 |
7 | 4320153113141134 |
oct | 464645626240765 |
9 | 83124211085774 |
10 | 21222211011061 |
11 | 684231a943515 |
12 | 246900b640a71 |
13 | bac327361828 |
14 | 53523657391b |
15 | 26c089981be1 |
hex | 134d2e5941f5 |
21222211011061 has 2 divisors, whose sum is σ = 21222211011062. Its totient is φ = 21222211011060.
The previous prime is 21222211011031. The next prime is 21222211011193. The reversal of 21222211011061 is 16011011222212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17170166816100 + 4052044194961 = 4143690^2 + 2012969^2 .
It is a cyclic number.
It is not a de Polignac number, because 21222211011061 - 27 = 21222211010933 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21222211011011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10611105505530 + 10611105505531.
It is an arithmetic number, because the mean of its divisors is an integer number (10611105505531).
Almost surely, 221222211011061 is an apocalyptic number.
It is an amenable number.
21222211011061 is a deficient number, since it is larger than the sum of its proper divisors (1).
21222211011061 is an equidigital number, since it uses as much as digits as its factorization.
21222211011061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 22.
Adding to 21222211011061 its reverse (16011011222212), we get a palindrome (37233222233273).
The spelling of 21222211011061 in words is "twenty-one trillion, two hundred twenty-two billion, two hundred eleven million, eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •