Base | Representation |
---|---|
bin | 11001000010010101000011… |
… | …100111100011111110111111 |
3 | 112102212112021121200112200121 |
4 | 121002111003213203332333 |
5 | 103413030230004341111 |
6 | 1030104220401435411 |
7 | 32123162312521405 |
oct | 3102250347437677 |
9 | 472775247615617 |
10 | 110111211012031 |
11 | 320a29a2028599 |
12 | 1042435993bb67 |
13 | 495959a649c18 |
14 | 1d295a7cbd475 |
15 | cae3a2cbd871 |
hex | 6425439e3fbf |
110111211012031 has 2 divisors, whose sum is σ = 110111211012032. Its totient is φ = 110111211012030.
The previous prime is 110111211011939. The next prime is 110111211012119. The reversal of 110111211012031 is 130210112111011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110111211012031 - 211 = 110111211009983 is a prime.
It is a super-2 number, since 2×1101112110120312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110111211011996 and 110111211012014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110111211012931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055605506015 + 55055605506016.
It is an arithmetic number, because the mean of its divisors is an integer number (55055605506016).
Almost surely, 2110111211012031 is an apocalyptic number.
110111211012031 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111211012031 is an equidigital number, since it uses as much as digits as its factorization.
110111211012031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 16.
Adding to 110111211012031 its reverse (130210112111011), we get a palindrome (240321323123042).
The spelling of 110111211012031 in words is "one hundred ten trillion, one hundred eleven billion, two hundred eleven million, twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •