Base | Representation |
---|---|
bin | 110011001111000010… |
… | …0011000001010001001 |
3 | 101111222220120112001222 |
4 | 1212132010120022021 |
5 | 3300313142130212 |
6 | 122313441451425 |
7 | 10643356450244 |
oct | 1463604301211 |
9 | 344886515058 |
10 | 110026130057 |
11 | 42730977aa8 |
12 | 193a7640b75 |
13 | a4b5a4858c |
14 | 547a86625b |
15 | 2cde559c72 |
hex | 199e118289 |
110026130057 has 2 divisors, whose sum is σ = 110026130058. Its totient is φ = 110026130056.
The previous prime is 110026130051. The next prime is 110026130059. The reversal of 110026130057 is 750031620011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 57605280121 + 52420849936 = 240011^2 + 228956^2 .
It is a cyclic number.
It is not a de Polignac number, because 110026130057 - 216 = 110026064521 is a prime.
Together with 110026130059, 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 (110026130051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55013065028 + 55013065029.
It is an arithmetic number, because the mean of its divisors is an integer number (55013065029).
Almost surely, 2110026130057 is an apocalyptic number.
It is an amenable number.
110026130057 is a deficient number, since it is larger than the sum of its proper divisors (1).
110026130057 is an equidigital number, since it uses as much as digits as its factorization.
110026130057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 26.
Adding to 110026130057 its reverse (750031620011), we get a palindrome (860057750068).
The spelling of 110026130057 in words is "one hundred ten billion, twenty-six million, one hundred thirty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •