Base | Representation |
---|---|
bin | 11001001111011010001110… |
… | …001011011111101110010001 |
3 | 112120001110111102221001002012 |
4 | 121033122032023133232101 |
5 | 104022242201142014414 |
6 | 1032033201321032305 |
7 | 32245134005012663 |
oct | 3117321613375621 |
9 | 476043442831065 |
10 | 111010110110609 |
11 | 3240a13a1478a6 |
12 | 1054a605325695 |
13 | 49c3292ccac68 |
14 | 1d5acbcdb0533 |
15 | cc796383733e |
hex | 64f68e2dfb91 |
111010110110609 has 2 divisors, whose sum is σ = 111010110110610. Its totient is φ = 111010110110608.
The previous prime is 111010110110587. The next prime is 111010110110611. The reversal of 111010110110609 is 906011011010111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 94585408603009 + 16424701507600 = 9725503^2 + 4052740^2 .
It is an emirp because it is prime and its reverse (906011011010111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111010110110609 - 216 = 111010110045073 is a prime.
Together with 111010110110611, 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 (111010110112609) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55505055055304 + 55505055055305.
It is an arithmetic number, because the mean of its divisors is an integer number (55505055055305).
Almost surely, 2111010110110609 is an apocalyptic number.
It is an amenable number.
111010110110609 is a deficient number, since it is larger than the sum of its proper divisors (1).
111010110110609 is an equidigital number, since it uses as much as digits as its factorization.
111010110110609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 23.
The spelling of 111010110110609 in words is "one hundred eleven trillion, ten billion, one hundred ten million, one hundred ten thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •