Base | Representation |
---|---|
bin | 11010001011101101110101… |
… | …001111010111000110100001 |
3 | 120002201122110121110001102112 |
4 | 122023231311033113012201 |
5 | 110043142034243242423 |
6 | 1044525100553525105 |
7 | 33153424526340152 |
oct | 3213556517270641 |
9 | 502648417401375 |
10 | 115154335134113 |
11 | 33767752130270 |
12 | 10ab9821a13795 |
13 | 4c34012ab6192 |
14 | 20616dcb09929 |
15 | d4a6663d7a78 |
hex | 68bb753d71a1 |
115154335134113 has 16 divisors (see below), whose sum is σ = 129040694927424. Its totient is φ = 101838595901760.
The previous prime is 115154335134061. The next prime is 115154335134133. The reversal of 115154335134113 is 311431533451511.
It is a cyclic number.
It is not a de Polignac number, because 115154335134113 - 26 = 115154335134049 is a prime.
It is a super-2 number, since 2×1151543351341132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (115154335134133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22418195 + ... + 27071832.
It is an arithmetic number, because the mean of its divisors is an integer number (8065043432964).
Almost surely, 2115154335134113 is an apocalyptic number.
It is an amenable number.
115154335134113 is a deficient number, since it is larger than the sum of its proper divisors (13886359793311).
115154335134113 is a wasteful number, since it uses less digits than its factorization.
115154335134113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49495792.
The product of its digits is 162000, while the sum is 41.
Adding to 115154335134113 its reverse (311431533451511), we get a palindrome (426585868585624).
The spelling of 115154335134113 in words is "one hundred fifteen trillion, one hundred fifty-four billion, three hundred thirty-five million, one hundred thirty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •