Search a number
-
+
115606325726131 = 298041274957457
BaseRepresentation
bin11010010010010010110001…
…111110101000101110110011
3120011022212010121111010221111
4122102102301332220232303
5110123043223341214011
61045512451324534151
733231165344103202
oct3222226176505663
9504285117433844
10115606325726131
1133921405026989
1210b713446b1357
134c678256c6326
142079539b29239
15d572bc2cb121
hex6924b1fa8bb3

115606325726131 has 8 divisors (see below), whose sum is σ = 119592923598720. Its totient is φ = 111619739376768.

The previous prime is 115606325726063. The next prime is 115606325726147. The reversal of 115606325726131 is 131627523606511.

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 115606325726131 - 235 = 115571965987763 is a prime.

It is a super-2 number, since 2×1156063257261312 (a number of 29 digits) contains 22 as substring.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (115606325726161) 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, 20840955 + ... + 25798411.

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

Almost surely, 2115606325726131 is an apocalyptic number.

115606325726131 is a deficient number, since it is larger than the sum of its proper divisors (3986597872589).

115606325726131 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 5761613.

The product of its (nonzero) digits is 1360800, while the sum is 49.

The spelling of 115606325726131 in words is "one hundred fifteen trillion, six hundred six billion, three hundred twenty-five million, seven hundred twenty-six thousand, one hundred thirty-one".

Divisors: 1 29 804127 4957457 23319683 143766253 3986425025039 115606325726131