Base | Representation |
---|---|
bin | 1011000110110001111100… |
… | …1110011111101010000101 |
3 | 1121020101000122220211021002 |
4 | 2301230133032133222011 |
5 | 3100031331133302114 |
6 | 41545413104503045 |
7 | 2400136556463431 |
oct | 261543716375205 |
9 | 47211018824232 |
10 | 12211115915909 |
11 | 3988783656169 |
12 | 145271a01aa85 |
13 | 6a76709603a1 |
14 | 3030421059c1 |
15 | 16298c1ce7de |
hex | b1b1f39fa85 |
12211115915909 has 2 divisors, whose sum is σ = 12211115915910. Its totient is φ = 12211115915908.
The previous prime is 12211115915879. The next prime is 12211115915917. The reversal of 12211115915909 is 90951951111221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10123533062500 + 2087582853409 = 3181750^2 + 1444847^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12211115915909 is a prime.
It is a super-2 number, since 2×122111159159092 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12211115915939) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105557957954 + 6105557957955.
It is an arithmetic number, because the mean of its divisors is an integer number (6105557957955).
Almost surely, 212211115915909 is an apocalyptic number.
It is an amenable number.
12211115915909 is a deficient number, since it is larger than the sum of its proper divisors (1).
12211115915909 is an equidigital number, since it uses as much as digits as its factorization.
12211115915909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72900, while the sum is 47.
The spelling of 12211115915909 in words is "twelve trillion, two hundred eleven billion, one hundred fifteen million, nine hundred fifteen thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •