Base | Representation |
---|---|
bin | 110011010001001111… |
… | …0111110010111000101 |
3 | 101112012001222020012211 |
4 | 1212202132332113011 |
5 | 3300441123224031 |
6 | 122325045343421 |
7 | 10645246232134 |
oct | 1464236762705 |
9 | 345161866184 |
10 | 110100211141 |
11 | 42769776238 |
12 | 19408407b71 |
13 | a4c81b583b |
14 | 548662b91b |
15 | 2ce5cdebb1 |
hex | 19a27be5c5 |
110100211141 has 2 divisors, whose sum is σ = 110100211142. Its totient is φ = 110100211140.
The previous prime is 110100211033. The next prime is 110100211147. The reversal of 110100211141 is 141112001011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 71858844225 + 38241366916 = 268065^2 + 195554^2 .
It is an emirp because it is prime and its reverse (141112001011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110100211141 - 29 = 110100210629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110100211147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050105570 + 55050105571.
It is an arithmetic number, because the mean of its divisors is an integer number (55050105571).
Almost surely, 2110100211141 is an apocalyptic number.
It is an amenable number.
110100211141 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100211141 is an equidigital number, since it uses as much as digits as its factorization.
110100211141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110100211141 its reverse (141112001011), we get a palindrome (251212212152).
The spelling of 110100211141 in words is "one hundred ten billion, one hundred million, two hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •