Base | Representation |
---|---|
bin | 1011111011001010101010… |
… | …0101110010111111110001 |
3 | 1201102102001020221012102111 |
4 | 2332302222211302333301 |
5 | 3204303014132103241 |
6 | 43515053542445321 |
7 | 2522150223042115 |
oct | 276625245627761 |
9 | 51372036835374 |
10 | 13111102222321 |
11 | 41a5429442844 |
12 | 1579029733841 |
13 | 7414aa63367c |
14 | 33481b765745 |
15 | 17b0b3403c81 |
hex | becaa972ff1 |
13111102222321 has 2 divisors, whose sum is σ = 13111102222322. Its totient is φ = 13111102222320.
The previous prime is 13111102222291. The next prime is 13111102222331. The reversal of 13111102222321 is 12322220111131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11479147071921 + 1631955150400 = 3388089^2 + 1277480^2 .
It is a cyclic number.
It is not a de Polignac number, because 13111102222321 - 27 = 13111102222193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13111102222292 and 13111102222301.
It is not a weakly prime, because it can be changed into another prime (13111102222331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555551111160 + 6555551111161.
It is an arithmetic number, because the mean of its divisors is an integer number (6555551111161).
Almost surely, 213111102222321 is an apocalyptic number.
It is an amenable number.
13111102222321 is a deficient number, since it is larger than the sum of its proper divisors (1).
13111102222321 is an equidigital number, since it uses as much as digits as its factorization.
13111102222321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 13111102222321 its reverse (12322220111131), we get a palindrome (25433322333452).
The spelling of 13111102222321 in words is "thirteen trillion, one hundred eleven billion, one hundred two million, two hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •