Base | Representation |
---|---|
bin | 110011001110110110… |
… | …1000101000001111001 |
3 | 101111222111002012221012 |
4 | 1212131231011001321 |
5 | 3300310111204033 |
6 | 122313102523305 |
7 | 10643253521531 |
oct | 1463555050171 |
9 | 344874065835 |
10 | 110020022393 |
11 | 42728486246 |
12 | 193a5596535 |
13 | a4b46ba588 |
14 | 5479b164c1 |
15 | 2cddc50248 |
hex | 199db45079 |
110020022393 has 2 divisors, whose sum is σ = 110020022394. Its totient is φ = 110020022392.
The previous prime is 110020022389. The next prime is 110020022461. The reversal of 110020022393 is 393220020011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 56433328249 + 53586694144 = 237557^2 + 231488^2 .
It is a cyclic number.
It is not a de Polignac number, because 110020022393 - 22 = 110020022389 is a prime.
It is not a weakly prime, because it can be changed into another prime (110020022363) 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, 55010011196 + 55010011197.
It is an arithmetic number, because the mean of its divisors is an integer number (55010011197).
Almost surely, 2110020022393 is an apocalyptic number.
It is an amenable number.
110020022393 is a deficient number, since it is larger than the sum of its proper divisors (1).
110020022393 is an equidigital number, since it uses as much as digits as its factorization.
110020022393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
The spelling of 110020022393 in words is "one hundred ten billion, twenty million, twenty-two thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •