Base | Representation |
---|---|
bin | 11001000010010101000010… |
… | …111101100011110000000101 |
3 | 112102212112020211222010102201 |
4 | 121002111002331203300011 |
5 | 103413030214200013104 |
6 | 1030104215325434501 |
7 | 32123162120111353 |
oct | 3102250275436005 |
9 | 472775224863381 |
10 | 110111200001029 |
11 | 320a2996897897 |
12 | 1042435610ba31 |
13 | 4959598293136 |
14 | 1d295a66547d3 |
15 | cae3a1d460a4 |
hex | 642542f63c05 |
110111200001029 has 2 divisors, whose sum is σ = 110111200001030. Its totient is φ = 110111200001028.
The previous prime is 110111200000999. The next prime is 110111200001071. The reversal of 110111200001029 is 920100002111011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 77857716984804 + 32253483016225 = 8823702^2 + 5679215^2 .
It is an emirp because it is prime and its reverse (920100002111011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110111200001029 - 221 = 110111197903877 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110111200000997 and 110111200001015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110111200001729) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055600000514 + 55055600000515.
It is an arithmetic number, because the mean of its divisors is an integer number (55055600000515).
Almost surely, 2110111200001029 is an apocalyptic number.
It is an amenable number.
110111200001029 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111200001029 is an equidigital number, since it uses as much as digits as its factorization.
110111200001029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 19.
The spelling of 110111200001029 in words is "one hundred ten trillion, one hundred eleven billion, two hundred million, one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •