Search a number
-
+
115206615241 = 131225912
BaseRepresentation
bin110101101001011011…
…0010111000011001001
3102000100221120102202121
41223102312113003021
53341420343141431
6124531501331241
711215633033504
oct1532266270311
9360327512677
10115206615241
114494a149213
121a3b2566b21
13ab300bab23
14580c8aa13b
152ee4263611
hex1ad2d970c9

115206615241 has 9 divisors (see below), whose sum is σ = 116137591789. Its totient is φ = 114283050700.

The previous prime is 115206615169. The next prime is 115206615253. The reversal of 115206615241 is 142516602511.

The square root of 115206615241 is 339421.

It is a perfect power (a square), and thus also a powerful number.

It is not a de Polignac number, because 115206615241 - 29 = 115206614729 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 115206615197 and 115206615206.

It is not an unprimeable number, because it can be changed into a prime (115206615341) by changing a digit.

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

It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 44462856 + ... + 44465446.

Almost surely, 2115206615241 is an apocalyptic number.

115206615241 is the 339421-st square number.

115206615241 is the 169711-st centered octagonal number.

It is an amenable number.

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

115206615241 is an frugal number, since it uses more digits than its factorization.

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

The sum of its prime factors is 5444 (or 2722 counting only the distinct ones).

The product of its (nonzero) digits is 14400, while the sum is 34.

The spelling of 115206615241 in words is "one hundred fifteen billion, two hundred six million, six hundred fifteen thousand, two hundred forty-one".

Divisors: 1 131 2591 17161 339421 6713281 44464151 879439811 115206615241