Base | Representation |
---|---|
bin | 1011000110110010010001… |
… | …0011001001100011000101 |
3 | 1121020101020121001200002001 |
4 | 2301230210103021203011 |
5 | 3100032014430202044 |
6 | 41545425344545301 |
7 | 2400141642044533 |
oct | 261544423114305 |
9 | 47211217050061 |
10 | 12211201022149 |
11 | 39888176a47a8 |
12 | 1452742622231 |
13 | 6a768548a9cc |
14 | 30304d53b153 |
15 | 1629948e12d4 |
hex | b1b244c98c5 |
12211201022149 has 2 divisors, whose sum is σ = 12211201022150. Its totient is φ = 12211201022148.
The previous prime is 12211201022057. The next prime is 12211201022201. The reversal of 12211201022149 is 94122010211221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11915544572100 + 295656450049 = 3451890^2 + 543743^2 .
It is a cyclic number.
It is not a de Polignac number, because 12211201022149 - 27 = 12211201022021 is a prime.
It is a super-2 number, since 2×122112010221492 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12211201020149) 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, 6105600511074 + 6105600511075.
It is an arithmetic number, because the mean of its divisors is an integer number (6105600511075).
Almost surely, 212211201022149 is an apocalyptic number.
It is an amenable number.
12211201022149 is a deficient number, since it is larger than the sum of its proper divisors (1).
12211201022149 is an equidigital number, since it uses as much as digits as its factorization.
12211201022149 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 28.
The spelling of 12211201022149 in words is "twelve trillion, two hundred eleven billion, two hundred one million, twenty-two thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •