Base | Representation |
---|---|
bin | 110011011010100010… |
… | …1100011011000011101 |
3 | 101112222211020201001012 |
4 | 1212311011203120131 |
5 | 3302111023023031 |
6 | 122420035025005 |
7 | 10656056120333 |
oct | 1466505433035 |
9 | 345884221035 |
10 | 110412314141 |
11 | 429099668a8 |
12 | 19494a3b165 |
13 | a547a6047c |
14 | 54b5c71b53 |
15 | 2d133deb2b |
hex | 19b516361d |
110412314141 has 2 divisors, whose sum is σ = 110412314142. Its totient is φ = 110412314140.
The previous prime is 110412314083. The next prime is 110412314149. The reversal of 110412314141 is 141413214011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108112728025 + 2299586116 = 328805^2 + 47954^2 .
It is a cyclic number.
It is not a de Polignac number, because 110412314141 - 214 = 110412297757 is a prime.
It is a super-2 number, since 2×1104123141412 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110412314149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55206157070 + 55206157071.
It is an arithmetic number, because the mean of its divisors is an integer number (55206157071).
Almost surely, 2110412314141 is an apocalyptic number.
It is an amenable number.
110412314141 is a deficient number, since it is larger than the sum of its proper divisors (1).
110412314141 is an equidigital number, since it uses as much as digits as its factorization.
110412314141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 110412314141 its reverse (141413214011), we get a palindrome (251825528152).
The spelling of 110412314141 in words is "one hundred ten billion, four hundred twelve million, three hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •