Base | Representation |
---|---|
bin | 1010000001100100111011… |
… | …1011000111101001110101 |
3 | 1110000201020210001212000222 |
4 | 2200121032323013221311 |
5 | 2421041441302432404 |
6 | 35235311121144125 |
7 | 2215220433610442 |
oct | 240311673075165 |
9 | 43021223055028 |
10 | 11022210202229 |
11 | 356a547346646 |
12 | 12a0217a8b045 |
13 | 61c50b992c55 |
14 | 2a16991d29c9 |
15 | 141aa64a9dbe |
hex | a064eec7a75 |
11022210202229 has 2 divisors, whose sum is σ = 11022210202230. Its totient is φ = 11022210202228.
The previous prime is 11022210202177. The next prime is 11022210202247. The reversal of 11022210202229 is 92220201222011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7703899848100 + 3318310354129 = 2775590^2 + 1821623^2 .
It is a cyclic number.
It is not a de Polignac number, because 11022210202229 - 220 = 11022209153653 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11022210202198 and 11022210202207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11022210202529) 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, 5511105101114 + 5511105101115.
It is an arithmetic number, because the mean of its divisors is an integer number (5511105101115).
Almost surely, 211022210202229 is an apocalyptic number.
It is an amenable number.
11022210202229 is a deficient number, since it is larger than the sum of its proper divisors (1).
11022210202229 is an equidigital number, since it uses as much as digits as its factorization.
11022210202229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 26.
The spelling of 11022210202229 in words is "eleven trillion, twenty-two billion, two hundred ten million, two hundred two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •