Base | Representation |
---|---|
bin | 11010001011011000010111… |
… | …011111110100001011100101 |
3 | 120002122102222101100121110122 |
4 | 122023120113133310023211 |
5 | 110042302334103141431 |
6 | 1044510330000131325 |
7 | 33151650430205315 |
oct | 3213302737641345 |
9 | 502572871317418 |
10 | 115131287552741 |
11 | 337589a53a2259 |
12 | 10ab526b306b45 |
13 | 4c31aabc07775 |
14 | 2060553b93445 |
15 | d49c67d29a7b |
hex | 68b6177f42e5 |
115131287552741 has 8 divisors (see below), whose sum is σ = 127203877808064. Its totient is φ = 103647604139200.
The previous prime is 115131287552719. The next prime is 115131287552761. The reversal of 115131287552741 is 147255782131511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 115131287552741 - 214 = 115131287536357 is a prime.
It is a super-2 number, since 2×1151312875527412 (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 (115131287552761) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 147226710035 + ... + 147226710816.
It is an arithmetic number, because the mean of its divisors is an integer number (15900484726008).
Almost surely, 2115131287552741 is an apocalyptic number.
It is an amenable number.
115131287552741 is a deficient number, since it is larger than the sum of its proper divisors (12072590255323).
115131287552741 is a wasteful number, since it uses less digits than its factorization.
115131287552741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 294453420891.
The product of its digits is 2352000, while the sum is 53.
The spelling of 115131287552741 in words is "one hundred fifteen trillion, one hundred thirty-one billion, two hundred eighty-seven million, five hundred fifty-two thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •