Base | Representation |
---|---|
bin | 111101000011001001… |
… | …0100101010001111011 |
3 | 110112101201121112100021 |
4 | 1322012102211101323 |
5 | 4121444110141430 |
6 | 140121043351311 |
7 | 12320554633360 |
oct | 1720622452173 |
9 | 415351545307 |
10 | 131102037115 |
11 | 50666755a05 |
12 | 214a9982537 |
13 | c4942b97ba |
14 | 64b99b8467 |
15 | 362499d07a |
hex | 1e864a547b |
131102037115 has 64 divisors (see below), whose sum is σ = 186848944128. Its totient is φ = 86448499200.
The previous prime is 131102037091. The next prime is 131102037139. The reversal of 131102037115 is 511730201131.
It is an interprime number because it is at equal distance from previous prime (131102037091) and next prime (131102037139).
It is not a de Polignac number, because 131102037115 - 211 = 131102035067 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131102037115.
It is an unprimeable number.
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 in 63 ways as a sum of consecutive naturals, for example, 37022245 + ... + 37025785.
It is an arithmetic number, because the mean of its divisors is an integer number (2919514752).
Almost surely, 2131102037115 is an apocalyptic number.
131102037115 is a deficient number, since it is larger than the sum of its proper divisors (55746907013).
131102037115 is a wasteful number, since it uses less digits than its factorization.
131102037115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3988.
The product of its (nonzero) digits is 630, while the sum is 25.
Adding to 131102037115 its reverse (511730201131), we get a palindrome (642832238246).
The spelling of 131102037115 in words is "one hundred thirty-one billion, one hundred two million, thirty-seven thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •