Base | Representation |
---|---|
bin | 110011101111101000… |
… | …1111011000101011101 |
3 | 101121211011021000221001 |
4 | 1213133101323011131 |
5 | 3310033232400104 |
6 | 123014203310301 |
7 | 11012443054516 |
oct | 1473721730535 |
9 | 347734230831 |
10 | 111120200029 |
11 | 43142501a63 |
12 | 19651b1b391 |
13 | a62b601067 |
14 | 5541c9da0d |
15 | 2d5561daa4 |
hex | 19df47b15d |
111120200029 has 2 divisors, whose sum is σ = 111120200030. Its totient is φ = 111120200028.
The previous prime is 111120200027. The next prime is 111120200117. The reversal of 111120200029 is 920002021111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85265168004 + 25855032025 = 292002^2 + 160795^2 .
It is a cyclic number.
It is not a de Polignac number, because 111120200029 - 21 = 111120200027 is a prime.
Together with 111120200027, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 111120199979 and 111120200015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111120200027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55560100014 + 55560100015.
It is an arithmetic number, because the mean of its divisors is an integer number (55560100015).
Almost surely, 2111120200029 is an apocalyptic number.
It is an amenable number.
111120200029 is a deficient number, since it is larger than the sum of its proper divisors (1).
111120200029 is an equidigital number, since it uses as much as digits as its factorization.
111120200029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
The spelling of 111120200029 in words is "one hundred eleven billion, one hundred twenty million, two hundred thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •