Base | Representation |
---|---|
bin | 11001000010010100111101… |
… | …101010000011000001000011 |
3 | 112102212112000122111102011011 |
4 | 121002110331222003001003 |
5 | 103413030023404001011 |
6 | 1030104202430101351 |
7 | 32123156656446463 |
oct | 3102247552030103 |
9 | 472775018442134 |
10 | 110111111000131 |
11 | 320a295062912a |
12 | 1042433034a857 |
13 | 4959582a00b97 |
14 | 1d295988c7ba3 |
15 | cae399115621 |
hex | 64253da83043 |
110111111000131 has 2 divisors, whose sum is σ = 110111111000132. Its totient is φ = 110111111000130.
The previous prime is 110111111000063. The next prime is 110111111000167. The reversal of 110111111000131 is 131000111111011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110111111000131 - 219 = 110111110475843 is a prime.
It is a super-2 number, since 2×1101111110001312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110111111000431) 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, 55055555500065 + 55055555500066.
It is an arithmetic number, because the mean of its divisors is an integer number (55055555500066).
Almost surely, 2110111111000131 is an apocalyptic number.
110111111000131 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111111000131 is an equidigital number, since it uses as much as digits as its factorization.
110111111000131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 13.
Adding to 110111111000131 its reverse (131000111111011), we get a palindrome (241111222111142).
The spelling of 110111111000131 in words is "one hundred ten trillion, one hundred eleven billion, one hundred eleven million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •