Base | Representation |
---|---|
bin | 11001000011111010100101… |
… | …001011100011110000000001 |
3 | 112110020221122210010112212202 |
4 | 121003322211023203300001 |
5 | 103421322003314124414 |
6 | 1030230245422002545 |
7 | 32134101565021061 |
oct | 3103724513436001 |
9 | 473227583115782 |
10 | 110220222020609 |
11 | 32135151993818 |
12 | 10441501416455 |
13 | 4966950c925ac |
14 | 1d309899bd3a1 |
15 | cb213315b9de |
hex | 643ea52e3c01 |
110220222020609 has 2 divisors, whose sum is σ = 110220222020610. Its totient is φ = 110220222020608.
The previous prime is 110220222020569. The next prime is 110220222020611. The reversal of 110220222020609 is 906020222022011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102974354026384 + 7245867994225 = 10147628^2 + 2691815^2 .
It is a cyclic number.
It is not a de Polignac number, because 110220222020609 - 232 = 110215927053313 is a prime.
It is a super-2 number, since 2×1102202220206092 (a number of 29 digits) contains 22 as substring.
Together with 110220222020611, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (110220222020509) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55110111010304 + 55110111010305.
It is an arithmetic number, because the mean of its divisors is an integer number (55110111010305).
Almost surely, 2110220222020609 is an apocalyptic number.
It is an amenable number.
110220222020609 is a deficient number, since it is larger than the sum of its proper divisors (1).
110220222020609 is an equidigital number, since it uses as much as digits as its factorization.
110220222020609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 29.
The spelling of 110220222020609 in words is "one hundred ten trillion, two hundred twenty billion, two hundred twenty-two million, twenty thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •