Search a number
-
+
115500050301 = 31092251156913
BaseRepresentation
bin110101110010001010…
…1101110011101111101
3102001010101201110222210
41223210111232131331
53343021003102201
6125020542531033
711226125141346
oct1534425563575
9361111643883
10115500050301
1144a8a849329
121a474896a79
13ab78b2a73c
1458398510cd
15300edc71d6
hex1ae456e77d

115500050301 has 16 divisors (see below), whose sum is σ = 155482944320. Its totient is φ = 76259232000.

The previous prime is 115500050279. The next prime is 115500050311. The reversal of 115500050301 is 103050005511.

It is not a de Polignac number, because 115500050301 - 25 = 115500050269 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

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, 657621 + ... + 814533.

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

Almost surely, 2115500050301 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 159276.

The product of its (nonzero) digits is 375, while the sum is 21.

Adding to 115500050301 its reverse (103050005511), we get a palindrome (218550055812).

The spelling of 115500050301 in words is "one hundred fifteen billion, five hundred million, fifty thousand, three hundred one".

Divisors: 1 3 109 327 2251 6753 156913 245359 470739 736077 17103517 51310551 353211163 1059633489 38500016767 115500050301