Search a number
-
+
115194993126045 = 357193110335415107
BaseRepresentation
bin11010001100010011101100…
…101001010010101010011101
3120002212112102010122001011120
4122030103230221102222131
5110044323321220013140
61044555503235441153
733156364213511610
oct3214235451225235
9502775363561146
10115194993126045
1133782a16546398
1210b0568a1561b9
134c37ac228a281
142063678838177
15d4b745a451d0
hex68c4eca52a9d

115194993126045 has 256 divisors, whose sum is σ = 231213925662720. Its totient is φ = 47788042521600.

The previous prime is 115194993126019. The next prime is 115194993126079. The reversal of 115194993126045 is 540621399491511.

It is not a de Polignac number, because 115194993126045 - 216 = 115194993060509 is a prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 115194993126045.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 22556291382 + ... + 22556296488.

It is an arithmetic number, because the mean of its divisors is an integer number (903179397120).

Almost surely, 2115194993126045 is an apocalyptic number.

115194993126045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

It is an amenable number.

115194993126045 is an abundant number, since it is smaller than the sum of its proper divisors (116018932536675).

115194993126045 is a wasteful number, since it uses less digits than its factorization.

115194993126045 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 8816.

The product of its (nonzero) digits is 10497600, while the sum is 60.

The spelling of 115194993126045 in words is "one hundred fifteen trillion, one hundred ninety-four billion, nine hundred ninety-three million, one hundred twenty-six thousand, forty-five".