Base | Representation |
---|---|
bin | 1011000110001001010111… |
… | …0010111110110000110101 |
3 | 1121012022220022212200111111 |
4 | 2301202111302332300311 |
5 | 3044342022343240401 |
6 | 41540412005435021 |
7 | 2366302555261504 |
oct | 261422562766065 |
9 | 47168808780444 |
10 | 12200220290101 |
11 | 39840a2327238 |
12 | 145059910ba71 |
13 | 6a662554b51c |
14 | 3026cb04483b |
15 | 1625508aae51 |
hex | b1895cbec35 |
12200220290101 has 2 divisors, whose sum is σ = 12200220290102. Its totient is φ = 12200220290100.
The previous prime is 12200220290059. The next prime is 12200220290197. The reversal of 12200220290101 is 10109202200221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11825001562500 + 375218727601 = 3438750^2 + 612551^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12200220290101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12200220290501) 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, 6100110145050 + 6100110145051.
It is an arithmetic number, because the mean of its divisors is an integer number (6100110145051).
Almost surely, 212200220290101 is an apocalyptic number.
It is an amenable number.
12200220290101 is a deficient number, since it is larger than the sum of its proper divisors (1).
12200220290101 is an equidigital number, since it uses as much as digits as its factorization.
12200220290101 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.
Adding to 12200220290101 its reverse (10109202200221), we get a palindrome (22309422490322).
The spelling of 12200220290101 in words is "twelve trillion, two hundred billion, two hundred twenty million, two hundred ninety thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •