Base | Representation |
---|---|
bin | 1010001101001101100101… |
… | …0110000101011000000101 |
3 | 1110201211012111220121201002 |
4 | 2203103121112011120011 |
5 | 2432330330330202323 |
6 | 35511210111143045 |
7 | 2235525060546404 |
oct | 243233126053005 |
9 | 43654174817632 |
10 | 11222101022213 |
11 | 36372a2516224 |
12 | 1312b02b14a85 |
13 | 6353164a6063 |
14 | 2ab21c9b363b |
15 | 146da5064828 |
hex | a34d9585605 |
11222101022213 has 2 divisors, whose sum is σ = 11222101022214. Its totient is φ = 11222101022212.
The previous prime is 11222101022203. The next prime is 11222101022239. The reversal of 11222101022213 is 31222010122211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7877127050884 + 3344973971329 = 2806622^2 + 1828927^2 .
It is a cyclic number.
It is not a de Polignac number, because 11222101022213 - 210 = 11222101021189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11222101022203) 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, 5611050511106 + 5611050511107.
It is an arithmetic number, because the mean of its divisors is an integer number (5611050511107).
Almost surely, 211222101022213 is an apocalyptic number.
It is an amenable number.
11222101022213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11222101022213 is an equidigital number, since it uses as much as digits as its factorization.
11222101022213 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 20.
Adding to 11222101022213 its reverse (31222010122211), we get a palindrome (42444111144424).
The spelling of 11222101022213 in words is "eleven trillion, two hundred twenty-two billion, one hundred one million, twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •