Base | Representation |
---|---|
bin | 110101110110010101… |
… | …0111110010111001101 |
3 | 102001111010202102212210 |
4 | 1223230222332113031 |
5 | 3343312244310112 |
6 | 125042455021033 |
7 | 11232443256204 |
oct | 1535452762715 |
9 | 361433672783 |
10 | 115639838157 |
11 | 45051745a88 |
12 | 1a4b366a779 |
13 | ab9ba9234c |
14 | 585023c23b |
15 | 301c2dab3c |
hex | 1aecabe5cd |
115639838157 has 32 divisors (see below), whose sum is σ = 164873066112. Its totient is φ = 71840497664.
The previous prime is 115639838143. The next prime is 115639838161. The reversal of 115639838157 is 751838936511.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 115639838157 - 24 = 115639838141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 115639838097 and 115639838106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115639838117) 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 in 31 ways as a sum of consecutive naturals, for example, 12202573 + ... + 12212045.
It is an arithmetic number, because the mean of its divisors is an integer number (5152283316).
Almost surely, 2115639838157 is an apocalyptic number.
115639838157 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
115639838157 is a deficient number, since it is larger than the sum of its proper divisors (49233227955).
115639838157 is a wasteful number, since it uses less digits than its factorization.
115639838157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11837.
The product of its digits is 5443200, while the sum is 57.
The spelling of 115639838157 in words is "one hundred fifteen billion, six hundred thirty-nine million, eight hundred thirty-eight thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •