Base | Representation |
---|---|
bin | 1011000110001000100010… |
… | …1011011001110110101101 |
3 | 1121012022022222201221210022 |
4 | 2301202020223121312231 |
5 | 3044341100022400414 |
6 | 41540334104251525 |
7 | 2366264243451641 |
oct | 261421053316655 |
9 | 47168288657708 |
10 | 12200000200109 |
11 | 3983a9a072387 |
12 | 1450537470ba5 |
13 | 6a65bba7bb67 |
14 | 3026a9b12c21 |
15 | 16253b3d418e |
hex | b1888ad9dad |
12200000200109 has 2 divisors, whose sum is σ = 12200000200110. Its totient is φ = 12200000200108.
The previous prime is 12200000200103. The next prime is 12200000200151. The reversal of 12200000200109 is 90100200000221.
12200000200109 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., 12191061064900 + 8939135209 = 3491570^2 + 94547^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12200000200109 is a prime.
It is a super-2 number, since 2×122000002001092 (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 (12200000200103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100000100054 + 6100000100055.
It is an arithmetic number, because the mean of its divisors is an integer number (6100000100055).
Almost surely, 212200000200109 is an apocalyptic number.
It is an amenable number.
12200000200109 is a deficient number, since it is larger than the sum of its proper divisors (1).
12200000200109 is an equidigital number, since it uses as much as digits as its factorization.
12200000200109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
The spelling of 12200000200109 in words is "twelve trillion, two hundred billion, two hundred thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •