Base | Representation |
---|---|
bin | 1100110111010101001… |
… | …0011110100100010001 |
3 | 210010110122101200010122 |
4 | 3031311102132210101 |
5 | 12110112321011121 |
6 | 245310415040025 |
7 | 21652601303642 |
oct | 3156522364421 |
9 | 703418350118 |
10 | 221011110161 |
11 | 85804012256 |
12 | 36a00210015 |
13 | 17ac2323c3a |
14 | a9a87a76c9 |
15 | 5b37d685ab |
hex | 337549e911 |
221011110161 has 2 divisors, whose sum is σ = 221011110162. Its totient is φ = 221011110160.
The previous prime is 221011110083. The next prime is 221011110179. The reversal of 221011110161 is 161011110122.
221011110161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 208511870161 + 12499240000 = 456631^2 + 111800^2 .
It is a cyclic number.
It is not a de Polignac number, because 221011110161 - 218 = 221010848017 is a prime.
It is not a weakly prime, because it can be changed into another prime (221011110461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110505555080 + 110505555081.
It is an arithmetic number, because the mean of its divisors is an integer number (110505555081).
Almost surely, 2221011110161 is an apocalyptic number.
It is an amenable number.
221011110161 is a deficient number, since it is larger than the sum of its proper divisors (1).
221011110161 is an equidigital number, since it uses as much as digits as its factorization.
221011110161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 221011110161 its reverse (161011110122), we get a palindrome (382022220283).
The spelling of 221011110161 in words is "two hundred twenty-one billion, eleven million, one hundred ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •