Base | Representation |
---|---|
bin | 11010001101000010011111… |
… | …101110000011001010111111 |
3 | 120010001100010002000012011212 |
4 | 122031002133232003022333 |
5 | 110101134223441311411 |
6 | 1045034533334235035 |
7 | 33163123351161635 |
oct | 3215023756031277 |
9 | 503040102005155 |
10 | 115245242135231 |
11 | 337a226182575a |
12 | 10b133724b5a7b |
13 | 4c3c76c7b36c0 |
14 | 2065c84267355 |
15 | d4cbd71c568b |
hex | 68d09fb832bf |
115245242135231 has 16 divisors (see below), whose sum is σ = 130700008252800. Its totient is φ = 100736808103008.
The previous prime is 115245242135183. The next prime is 115245242135263. The reversal of 115245242135231 is 132531242542511.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115245242135231 is a prime.
It is a super-2 number, since 2×1152452421352312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115245242135281) 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, 102346961 + ... + 103466858.
It is an arithmetic number, because the mean of its divisors is an integer number (8168750515800).
Almost surely, 2115245242135231 is an apocalyptic number.
115245242135231 is a deficient number, since it is larger than the sum of its proper divisors (15454766117569).
115245242135231 is a wasteful number, since it uses less digits than its factorization.
115245242135231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 205816118.
The product of its digits is 288000, while the sum is 41.
Adding to 115245242135231 its reverse (132531242542511), we get a palindrome (247776484677742).
The spelling of 115245242135231 in words is "one hundred fifteen trillion, two hundred forty-five billion, two hundred forty-two million, one hundred thirty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •