Base | Representation |
---|---|
bin | 110010010000010001000001… |
… | …110111011101100011011011 |
3 | 1001222120022120022211002121212 |
4 | 302100101001313131203123 |
5 | 212432143202230011141 |
6 | 2102023124204453335 |
7 | 64361114444242616 |
oct | 6220210167354333 |
9 | 1058508508732555 |
10 | 221020122110171 |
11 | 6447311aa4849a |
12 | 2095721b84a24b |
13 | 96431535cb5c7 |
14 | 3c816068b917d |
15 | 1a84391ec82eb |
hex | c90441ddd8db |
221020122110171 has 2 divisors, whose sum is σ = 221020122110172. Its totient is φ = 221020122110170.
The previous prime is 221020122110141. The next prime is 221020122110201. The reversal of 221020122110171 is 171011221020122.
It is a balanced prime because it is at equal distance from previous prime (221020122110141) and next prime (221020122110201).
It is a cyclic number.
It is not a de Polignac number, because 221020122110171 - 210 = 221020122109147 is a prime.
It is not a weakly prime, because it can be changed into another prime (221020122110141) 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, 110510061055085 + 110510061055086.
It is an arithmetic number, because the mean of its divisors is an integer number (110510061055086).
Almost surely, 2221020122110171 is an apocalyptic number.
221020122110171 is a deficient number, since it is larger than the sum of its proper divisors (1).
221020122110171 is an equidigital number, since it uses as much as digits as its factorization.
221020122110171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 23.
Adding to 221020122110171 its reverse (171011221020122), we get a palindrome (392031343130293).
The spelling of 221020122110171 in words is "two hundred twenty-one trillion, twenty billion, one hundred twenty-two million, one hundred ten thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •