Base | Representation |
---|---|
bin | 10010101111010100… |
… | …100011101110000001 |
3 | 1220221021201111000112 |
4 | 102233110203232001 |
5 | 312202021134134 |
6 | 13124340401105 |
7 | 1311423661106 |
oct | 225724435601 |
9 | 56837644015 |
10 | 20121271169 |
11 | 8595a2992a |
12 | 3a966a6195 |
13 | 1b8885831c |
14 | d8c452aad |
15 | 7cb7231ce |
hex | 4af523b81 |
20121271169 has 2 divisors, whose sum is σ = 20121271170. Its totient is φ = 20121271168.
The previous prime is 20121271129. The next prime is 20121271201. The reversal of 20121271169 is 96117212102.
It is an a-pointer prime, because the next prime (20121271201) can be obtained adding 20121271169 to its sum of digits (32).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15841494769 + 4279776400 = 125863^2 + 65420^2 .
It is a cyclic number.
It is not a de Polignac number, because 20121271169 - 220 = 20120222593 is a prime.
It is a super-2 number, since 2×201212711692 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20121271109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10060635584 + 10060635585.
It is an arithmetic number, because the mean of its divisors is an integer number (10060635585).
Almost surely, 220121271169 is an apocalyptic number.
It is an amenable number.
20121271169 is a deficient number, since it is larger than the sum of its proper divisors (1).
20121271169 is an equidigital number, since it uses as much as digits as its factorization.
20121271169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 32.
The spelling of 20121271169 in words is "twenty billion, one hundred twenty-one million, two hundred seventy-one thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •