Base | Representation |
---|---|
bin | 1010001100000011100001… |
… | …1101101011011001111101 |
3 | 1110122220220010001021021122 |
4 | 2203000320131223121331 |
5 | 2432014122313341104 |
6 | 35454121343040325 |
7 | 2234222335005446 |
oct | 243007035533175 |
9 | 43586803037248 |
10 | 11202222012029 |
11 | 3629921314694 |
12 | 130b0955a00a5 |
13 | 633498bb0a39 |
14 | 2aa2947c42cd |
15 | 1465dec476be |
hex | a303876b67d |
11202222012029 has 2 divisors, whose sum is σ = 11202222012030. Its totient is φ = 11202222012028.
The previous prime is 11202222011957. The next prime is 11202222012089. The reversal of 11202222012029 is 92021022220211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11152594202500 + 49627809529 = 3339550^2 + 222773^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11202222012029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11202222011989 and 11202222012007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11202222012089) 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, 5601111006014 + 5601111006015.
It is an arithmetic number, because the mean of its divisors is an integer number (5601111006015).
Almost surely, 211202222012029 is an apocalyptic number.
It is an amenable number.
11202222012029 is a deficient number, since it is larger than the sum of its proper divisors (1).
11202222012029 is an equidigital number, since it uses as much as digits as its factorization.
11202222012029 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 11202222012029 in words is "eleven trillion, two hundred two billion, two hundred twenty-two million, twelve thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •