Base | Representation |
---|---|
bin | 110011101110101111… |
… | …1001001101001101011 |
3 | 101121202001122110110111 |
4 | 1213131133021221223 |
5 | 3310003032110011 |
6 | 123011210355151 |
7 | 11011626244564 |
oct | 1473537115153 |
9 | 347661573414 |
10 | 111090113131 |
11 | 43127522258 |
12 | 19643a2bab7 |
13 | a6252c866a |
14 | 553bcab16b |
15 | 2d52b79121 |
hex | 19dd7c9a6b |
111090113131 has 2 divisors, whose sum is σ = 111090113132. Its totient is φ = 111090113130.
The previous prime is 111090113119. The next prime is 111090113143. The reversal of 111090113131 is 131311090111.
It is a balanced prime because it is at equal distance from previous prime (111090113119) and next prime (111090113143).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111090113131 is a prime.
It is a super-2 number, since 2×1110901131312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (111090113831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55545056565 + 55545056566.
It is an arithmetic number, because the mean of its divisors is an integer number (55545056566).
Almost surely, 2111090113131 is an apocalyptic number.
111090113131 is a deficient number, since it is larger than the sum of its proper divisors (1).
111090113131 is an equidigital number, since it uses as much as digits as its factorization.
111090113131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 22.
The spelling of 111090113131 in words is "one hundred eleven billion, ninety million, one hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •