Base | Representation |
---|---|
bin | 11010001111111010010000… |
… | …011111000000101110101101 |
3 | 120010202012102011000210212210 |
4 | 122033322100133000232231 |
5 | 110112402323041433240 |
6 | 1045305324434321033 |
7 | 33213310063131126 |
oct | 3217722037005655 |
9 | 503665364023783 |
10 | 115442555030445 |
11 | 33868a048082a5 |
12 | 10b4565a129179 |
13 | 4c552561b2736 |
14 | 207164151104d |
15 | d52dd47b0780 |
hex | 68fe907c0bad |
115442555030445 has 32 divisors (see below), whose sum is σ = 186197584535424. Its totient is φ = 61073265427200.
The previous prime is 115442555030441. The next prime is 115442555030507. The reversal of 115442555030445 is 544030555244511.
It is not a de Polignac number, because 115442555030445 - 22 = 115442555030441 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 115442555030394 and 115442555030403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115442555030441) 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, 7947862 + ... + 17147991.
It is an arithmetic number, because the mean of its divisors is an integer number (5818674516732).
Almost surely, 2115442555030445 is an apocalyptic number.
115442555030445 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
115442555030445 is a deficient number, since it is larger than the sum of its proper divisors (70755029504979).
115442555030445 is a wasteful number, since it uses less digits than its factorization.
115442555030445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25098333.
The product of its (nonzero) digits is 4800000, while the sum is 48.
The spelling of 115442555030445 in words is "one hundred fifteen trillion, four hundred forty-two billion, five hundred fifty-five million, thirty thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •