Base | Representation |
---|---|
bin | 110011001110110110… |
… | …1000101000000010101 |
3 | 101111222111002012210111 |
4 | 1212131231011000111 |
5 | 3300310111203133 |
6 | 122313102523021 |
7 | 10643253521326 |
oct | 1463555050025 |
9 | 344874065714 |
10 | 110020022293 |
11 | 42728486165 |
12 | 193a5596471 |
13 | a4b46ba50c |
14 | 5479b1644d |
15 | 2cddc501cd |
hex | 199db45015 |
110020022293 has 2 divisors, whose sum is σ = 110020022294. Its totient is φ = 110020022292.
The previous prime is 110020022183. The next prime is 110020022347. The reversal of 110020022293 is 392220020011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109800775044 + 219247249 = 331362^2 + 14807^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110020022293 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110020022393) 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, 55010011146 + 55010011147.
It is an arithmetic number, because the mean of its divisors is an integer number (55010011147).
Almost surely, 2110020022293 is an apocalyptic number.
It is an amenable number.
110020022293 is a deficient number, since it is larger than the sum of its proper divisors (1).
110020022293 is an equidigital number, since it uses as much as digits as its factorization.
110020022293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
The spelling of 110020022293 in words is "one hundred ten billion, twenty million, twenty-two thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •