Base | Representation |
---|---|
bin | 1010000110001110001011… |
… | …0001111001000000001101 |
3 | 1110022100012111001211121121 |
4 | 2201203202301321000031 |
5 | 2423343344024102341 |
6 | 35340104414200541 |
7 | 2224043625600436 |
oct | 241434261710015 |
9 | 43270174054547 |
10 | 11102000222221 |
11 | 35a0371773627 |
12 | 12b37854b3151 |
13 | 626bb645802c |
14 | 2a54a810c48d |
15 | 143bc62ec4d1 |
hex | a18e2c7900d |
11102000222221 has 2 divisors, whose sum is σ = 11102000222222. Its totient is φ = 11102000222220.
The previous prime is 11102000222213. The next prime is 11102000222227. The reversal of 11102000222221 is 12222200020111.
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., 10117876701321 + 984123520900 = 3180861^2 + 992030^2 .
It is a cyclic number.
It is not a de Polignac number, because 11102000222221 - 23 = 11102000222213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11102000222195 and 11102000222204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11102000222227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551000111110 + 5551000111111.
It is an arithmetic number, because the mean of its divisors is an integer number (5551000111111).
Almost surely, 211102000222221 is an apocalyptic number.
It is an amenable number.
11102000222221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102000222221 is an equidigital number, since it uses as much as digits as its factorization.
11102000222221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 11102000222221 its reverse (12222200020111), we get a palindrome (23324200242332).
The spelling of 11102000222221 in words is "eleven trillion, one hundred two billion, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •