Base | Representation |
---|---|
bin | 110101100111111001… |
… | …0110001101010011111 |
3 | 102000020101002120212220 |
4 | 1223033302301222133 |
5 | 3341314232002111 |
6 | 124522430400423 |
7 | 11214441162660 |
oct | 1531762615237 |
9 | 360211076786 |
10 | 115155344031 |
11 | 4492320a412 |
12 | 1a399360113 |
13 | ab225a8c30 |
14 | 5805b61367 |
15 | 2ede9d6e06 |
hex | 1acfcb1a9f |
115155344031 has 16 divisors (see below), whose sum is σ = 188972872704. Its totient is φ = 60741280224.
The previous prime is 115155344023. The next prime is 115155344149. The reversal of 115155344031 is 130443551511.
It is a happy number.
It is not a de Polignac number, because 115155344031 - 23 = 115155344023 is a prime.
It is a super-2 number, since 2×1151553440312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 115155343983 and 115155344001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115155394031) 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 15 ways as a sum of consecutive naturals, for example, 210906951 + ... + 210907496.
It is an arithmetic number, because the mean of its divisors is an integer number (11810804544).
Almost surely, 2115155344031 is an apocalyptic number.
115155344031 is a deficient number, since it is larger than the sum of its proper divisors (73817528673).
115155344031 is a wasteful number, since it uses less digits than its factorization.
115155344031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 421814470.
The product of its (nonzero) digits is 18000, while the sum is 33.
Adding to 115155344031 its reverse (130443551511), we get a palindrome (245598895542).
The spelling of 115155344031 in words is "one hundred fifteen billion, one hundred fifty-five million, three hundred forty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •