Base | Representation |
---|---|
bin | 1010001100000010110001… |
… | …1011000100010111001101 |
3 | 1110122220101000221001120011 |
4 | 2203000230123010113031 |
5 | 2432013214110014404 |
6 | 35454045325153221 |
7 | 2234214332644621 |
oct | 243005433042715 |
9 | 43586330831504 |
10 | 11202020001229 |
11 | 3629828288a12 |
12 | 130b0399bb811 |
13 | 6334660a1415 |
14 | 2aa275a3b181 |
15 | 1465cc142604 |
hex | a302c6c45cd |
11202020001229 has 2 divisors, whose sum is σ = 11202020001230. Its totient is φ = 11202020001228.
The previous prime is 11202020001209. The next prime is 11202020001251. The reversal of 11202020001229 is 92210002020211.
It is an a-pointer prime, because the next prime (11202020001251) can be obtained adding 11202020001229 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9481195514025 + 1720824487204 = 3079155^2 + 1311802^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11202020001229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11202020001209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5601010000614 + 5601010000615.
It is an arithmetic number, because the mean of its divisors is an integer number (5601010000615).
Almost surely, 211202020001229 is an apocalyptic number.
It is an amenable number.
11202020001229 is a deficient number, since it is larger than the sum of its proper divisors (1).
11202020001229 is an equidigital number, since it uses as much as digits as its factorization.
11202020001229 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.
The spelling of 11202020001229 in words is "eleven trillion, two hundred two billion, twenty million, one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •