Base | Representation |
---|---|
bin | 1011000111010011110111… |
… | …1000010010000001010001 |
3 | 1121021020112011002101000111 |
4 | 2301310331320102001101 |
5 | 3100204002322334134 |
6 | 41553520331321321 |
7 | 2400611306113054 |
oct | 261647570220121 |
9 | 47236464071014 |
10 | 12220220121169 |
11 | 3991625750345 |
12 | 145443abb0241 |
13 | 6a8491b972a8 |
14 | 3036672c4a9b |
15 | 162d215e1c64 |
hex | b1d3de12051 |
12220220121169 has 2 divisors, whose sum is σ = 12220220121170. Its totient is φ = 12220220121168.
The previous prime is 12220220121149. The next prime is 12220220121173. The reversal of 12220220121169 is 96112102202221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10400702400144 + 1819517721025 = 3225012^2 + 1348895^2 .
It is a cyclic number.
It is not a de Polignac number, because 12220220121169 - 29 = 12220220120657 is a prime.
It is a super-2 number, since 2×122202201211692 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12220220121169.
It is not a weakly prime, because it can be changed into another prime (12220220121119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110110060584 + 6110110060585.
It is an arithmetic number, because the mean of its divisors is an integer number (6110110060585).
Almost surely, 212220220121169 is an apocalyptic number.
It is an amenable number.
12220220121169 is a deficient number, since it is larger than the sum of its proper divisors (1).
12220220121169 is an equidigital number, since it uses as much as digits as its factorization.
12220220121169 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 31.
The spelling of 12220220121169 in words is "twelve trillion, two hundred twenty billion, two hundred twenty million, one hundred twenty-one thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •