Base | Representation |
---|---|
bin | 1011000110110001111110… |
… | …0110001000001011011101 |
3 | 1121020101001002120120121012 |
4 | 2301230133212020023131 |
5 | 3100031334230024242 |
6 | 41545413445345005 |
7 | 2400136663235462 |
oct | 261543746101335 |
9 | 47211032516535 |
10 | 12211122111197 |
11 | 39887870a7839 |
12 | 1452720108165 |
13 | 6a767201c239 |
14 | 303042c79669 |
15 | 16298ca05282 |
hex | b1b1f9882dd |
12211122111197 has 2 divisors, whose sum is σ = 12211122111198. Its totient is φ = 12211122111196.
The previous prime is 12211122111059. The next prime is 12211122111241. The reversal of 12211122111197 is 79111122111221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9251659055716 + 2959463055481 = 3041654^2 + 1720309^2 .
It is a cyclic number.
It is not a de Polignac number, because 12211122111197 - 238 = 11936244204253 is a prime.
It is a super-2 number, since 2×122111221111972 (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 (12211122711197) 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, 6105561055598 + 6105561055599.
It is an arithmetic number, because the mean of its divisors is an integer number (6105561055599).
Almost surely, 212211122111197 is an apocalyptic number.
It is an amenable number.
12211122111197 is a deficient number, since it is larger than the sum of its proper divisors (1).
12211122111197 is an equidigital number, since it uses as much as digits as its factorization.
12211122111197 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1008, while the sum is 32.
The spelling of 12211122111197 in words is "twelve trillion, two hundred eleven billion, one hundred twenty-two million, one hundred eleven thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •