Base | Representation |
---|---|
bin | 1010001101001010001110… |
… | …1101001001110101110101 |
3 | 1110201201212210112211201021 |
4 | 2203102203231021311311 |
5 | 2432322004440201044 |
6 | 35510540522501141 |
7 | 2235463552414045 |
oct | 243224355116565 |
9 | 43651783484637 |
10 | 11221201100149 |
11 | 3636980537487 |
12 | 13128b16647b1 |
13 | 635201c08cb1 |
14 | 2ab175277725 |
15 | 146d51050e84 |
hex | a34a3b49d75 |
11221201100149 has 2 divisors, whose sum is σ = 11221201100150. Its totient is φ = 11221201100148.
The previous prime is 11221201100129. The next prime is 11221201100297. The reversal of 11221201100149 is 94100110212211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6954786919249 + 4266414180900 = 2637193^2 + 2065530^2 .
It is a cyclic number.
It is not a de Polignac number, because 11221201100149 - 225 = 11221167545717 is a prime.
It is a super-4 number, since 4×112212011001494 (a number of 53 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11221201100129) 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, 5610600550074 + 5610600550075.
It is an arithmetic number, because the mean of its divisors is an integer number (5610600550075).
Almost surely, 211221201100149 is an apocalyptic number.
It is an amenable number.
11221201100149 is a deficient number, since it is larger than the sum of its proper divisors (1).
11221201100149 is an equidigital number, since it uses as much as digits as its factorization.
11221201100149 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 25.
The spelling of 11221201100149 in words is "eleven trillion, two hundred twenty-one billion, two hundred one million, one hundred thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •