Base | Representation |
---|---|
bin | 1011000110001100101011… |
… | …1001001100000001001101 |
3 | 1121012102012102010000021022 |
4 | 2301203022321030001031 |
5 | 3044400333421002314 |
6 | 41541040231043525 |
7 | 2366333623153304 |
oct | 261431271140115 |
9 | 47172172100238 |
10 | 12201111109709 |
11 | 398450a159195 |
12 | 14507a75105a5 |
13 | 6a6737c7c412 |
14 | 30277349143b |
15 | 1625a3bc278e |
hex | b18cae4c04d |
12201111109709 has 2 divisors, whose sum is σ = 12201111109710. Its totient is φ = 12201111109708.
The previous prime is 12201111109697. The next prime is 12201111109739. The reversal of 12201111109709 is 90790111110221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11687304568900 + 513806540809 = 3418670^2 + 716803^2 .
It is a cyclic number.
It is not a de Polignac number, because 12201111109709 - 240 = 11101599481933 is a prime.
It is a super-2 number, since 2×122011111097092 (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 (12201111109739) 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, 6100555554854 + 6100555554855.
It is an arithmetic number, because the mean of its divisors is an integer number (6100555554855).
Almost surely, 212201111109709 is an apocalyptic number.
It is an amenable number.
12201111109709 is a deficient number, since it is larger than the sum of its proper divisors (1).
12201111109709 is an equidigital number, since it uses as much as digits as its factorization.
12201111109709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 35.
The spelling of 12201111109709 in words is "twelve trillion, two hundred one billion, one hundred eleven million, one hundred nine thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •