Base | Representation |
---|---|
bin | 110011010001010010… |
… | …1110011001001011101 |
3 | 101112012012100010101001 |
4 | 1212202211303021131 |
5 | 3300442103001341 |
6 | 122325151550301 |
7 | 10645300363123 |
oct | 1464245631135 |
9 | 345165303331 |
10 | 110102000221 |
11 | 4276a788414 |
12 | 19408b2b391 |
13 | a4c8690c75 |
14 | 5486975913 |
15 | 2ce6044d31 |
hex | 19a297325d |
110102000221 has 2 divisors, whose sum is σ = 110102000222. Its totient is φ = 110102000220.
The previous prime is 110102000191. The next prime is 110102000249. The reversal of 110102000221 is 122000201011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88572307321 + 21529692900 = 297611^2 + 146730^2 .
It is a cyclic number.
It is not a de Polignac number, because 110102000221 - 25 = 110102000189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110102000198 and 110102000207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110102000291) 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, 55051000110 + 55051000111.
It is an arithmetic number, because the mean of its divisors is an integer number (55051000111).
Almost surely, 2110102000221 is an apocalyptic number.
It is an amenable number.
110102000221 is a deficient number, since it is larger than the sum of its proper divisors (1).
110102000221 is an equidigital number, since it uses as much as digits as its factorization.
110102000221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 110102000221 its reverse (122000201011), we get a palindrome (232102201232).
The spelling of 110102000221 in words is "one hundred ten billion, one hundred two million, two hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •