Base | Representation |
---|---|
bin | 110011010001001111… |
… | …0101000101000110001 |
3 | 101112012001210201011021 |
4 | 1212202132220220301 |
5 | 3300441112402121 |
6 | 122325043415441 |
7 | 10645245411541 |
oct | 1464236505061 |
9 | 345161721137 |
10 | 110100122161 |
11 | 427697153a7 |
12 | 19408384581 |
13 | a4c81841a3 |
14 | 5486607321 |
15 | 2ce5cc3641 |
hex | 19a27a8a31 |
110100122161 has 2 divisors, whose sum is σ = 110100122162. Its totient is φ = 110100122160.
The previous prime is 110100122131. The next prime is 110100122189. The reversal of 110100122161 is 161221001011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106729623025 + 3370499136 = 326695^2 + 58056^2 .
It is a cyclic number.
It is not a de Polignac number, because 110100122161 - 211 = 110100120113 is a prime.
It is not a weakly prime, because it can be changed into another prime (110100122131) 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, 55050061080 + 55050061081.
It is an arithmetic number, because the mean of its divisors is an integer number (55050061081).
Almost surely, 2110100122161 is an apocalyptic number.
It is an amenable number.
110100122161 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100122161 is an equidigital number, since it uses as much as digits as its factorization.
110100122161 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 16.
Adding to 110100122161 its reverse (161221001011), we get a palindrome (271321123172).
The spelling of 110100122161 in words is "one hundred ten billion, one hundred million, one hundred twenty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •