Base | Representation |
---|---|
bin | 1010001100000011100001… |
… | …0110011101011101111001 |
3 | 1110122220212222111010210212 |
4 | 2203000320112131131321 |
5 | 2432014121322314204 |
6 | 35454121234320505 |
7 | 2234222312635226 |
oct | 243007026353571 |
9 | 43586788433725 |
10 | 11202220119929 |
11 | 3629920242073 |
12 | 130b094a29135 |
13 | 63349869a757 |
14 | 2aa29445094d |
15 | 1465de9c1c6e |
hex | a303859d779 |
11202220119929 has 2 divisors, whose sum is σ = 11202220119930. Its totient is φ = 11202220119928.
The previous prime is 11202220119907. The next prime is 11202220120037. The reversal of 11202220119929 is 92991102220211.
11202220119929 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8968988759929 + 2233231360000 = 2994827^2 + 1494400^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11202220119929 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11202220119829) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5601110059964 + 5601110059965.
It is an arithmetic number, because the mean of its divisors is an integer number (5601110059965).
Almost surely, 211202220119929 is an apocalyptic number.
It is an amenable number.
11202220119929 is a deficient number, since it is larger than the sum of its proper divisors (1).
11202220119929 is an equidigital number, since it uses as much as digits as its factorization.
11202220119929 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23328, while the sum is 41.
The spelling of 11202220119929 in words is "eleven trillion, two hundred two billion, two hundred twenty million, one hundred nineteen thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •