Search a number
-
+
115040315035 = 5172946669499
BaseRepresentation
bin110101100100011101…
…1111110011010011011
3101222221100122111202201
41223020323332122123
53341100310040120
6124503201111031
711211543354322
oct1531073763233
9358840574681
10115040315035
1144874293428
121a366928477
13ab04802839
1457d477b0b9
152ed486440a
hex1ac8efe69b

115040315035 has 16 divisors (see below), whose sum is σ = 151209180000. Its totient is φ = 83631740416.

The previous prime is 115040315029. The next prime is 115040315051. The reversal of 115040315035 is 530513040511.

It is a cyclic number.

It is not a de Polignac number, because 115040315035 - 211 = 115040312987 is a prime.

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

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 15 ways as a sum of consecutive naturals, for example, 23332285 + ... + 23337214.

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

Almost surely, 2115040315035 is an apocalyptic number.

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

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

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

The sum of its prime factors is 46669550.

The product of its (nonzero) digits is 4500, while the sum is 28.

Adding to 115040315035 its reverse (530513040511), we get a palindrome (645553355546).

The spelling of 115040315035 in words is "one hundred fifteen billion, forty million, three hundred fifteen thousand, thirty-five".

Divisors: 1 5 17 29 85 145 493 2465 46669499 233347495 793381483 1353415471 3966907415 6767077355 23008063007 115040315035