Base | Representation |
---|---|
bin | 11001000010001110101010… |
… | …000100101111110010111111 |
3 | 112102211212112202200011122211 |
4 | 121002032222010233302333 |
5 | 103412422142020112111 |
6 | 1030101122512121251 |
7 | 32122530121104202 |
oct | 3102165204576277 |
9 | 472755482604584 |
10 | 110104340004031 |
11 | 3209aa9657758a |
12 | 10422b60836227 |
13 | 4958a43c98a09 |
14 | 1d2911553d939 |
15 | cae0ee984521 |
hex | 6423aa12fcbf |
110104340004031 has 2 divisors, whose sum is σ = 110104340004032. Its totient is φ = 110104340004030.
The previous prime is 110104340003989. The next prime is 110104340004037. The reversal of 110104340004031 is 130400043401011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110104340004031 - 211 = 110104340001983 is a prime.
It is a super-2 number, since 2×1101043400040312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110104340003993 and 110104340004011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110104340004037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55052170002015 + 55052170002016.
It is an arithmetic number, because the mean of its divisors is an integer number (55052170002016).
Almost surely, 2110104340004031 is an apocalyptic number.
110104340004031 is a deficient number, since it is larger than the sum of its proper divisors (1).
110104340004031 is an equidigital number, since it uses as much as digits as its factorization.
110104340004031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 110104340004031 its reverse (130400043401011), we get a palindrome (240504383405042).
The spelling of 110104340004031 in words is "one hundred ten trillion, one hundred four billion, three hundred forty million, four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •