Base | Representation |
---|---|
bin | 11010010011100010010101… |
… | …110100101001011101101100 |
3 | 120011122000122011101121222012 |
4 | 122103202111310221131230 |
5 | 110130443202142112224 |
6 | 1050020020225140352 |
7 | 33240311324243360 |
oct | 3223422564513554 |
9 | 504560564347865 |
10 | 115691752691564 |
11 | 33954662353465 |
12 | 10b85a05a8a6b8 |
13 | 4c728bac7cc9a |
14 | 207d7215492a0 |
15 | d5961be3e80e |
hex | 693895d2976c |
115691752691564 has 96 divisors (see below), whose sum is σ = 244862855086080. Its totient is φ = 46798713928512.
The previous prime is 115691752691561. The next prime is 115691752691587. The reversal of 115691752691564 is 465196257196511.
It is a junction number, because it is equal to n+sod(n) for n = 115691752691494 and 115691752691503.
It is not an unprimeable number, because it can be changed into a prime (115691752691561) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8469152 + ... + 17410055.
It is an arithmetic number, because the mean of its divisors is an integer number (2550654740480).
Almost surely, 2115691752691564 is an apocalyptic number.
115691752691564 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
115691752691564 is an abundant number, since it is smaller than the sum of its proper divisors (129171102394516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115691752691564 is a wasteful number, since it uses less digits than its factorization.
115691752691564 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25879387 (or 25879385 counting only the distinct ones).
The product of its digits is 122472000, while the sum is 68.
The spelling of 115691752691564 in words is "one hundred fifteen trillion, six hundred ninety-one billion, seven hundred fifty-two million, six hundred ninety-one thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •