Search a number
-
+
115550722011 = 338516907337
BaseRepresentation
bin110101110011101011…
…1000001011111011011
3102001020221001212111210
41223213113001133123
53343121441101021
6125025552554203
711230311634314
oct1534727013733
9361227055453
10115550722011
114500640877a
121a489852963
13ab8648c7ba
14584248160b
153014585e76
hex1ae75c17db

115550722011 has 4 divisors (see below), whose sum is σ = 154067629352. Its totient is φ = 77033814672.

The previous prime is 115550721989. The next prime is 115550722087. The reversal of 115550722011 is 110227055511.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 115550722011 - 213 = 115550713819 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (115550722711) 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 3 ways as a sum of consecutive naturals, for example, 19258453666 + ... + 19258453671.

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

Almost surely, 2115550722011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 38516907340.

The product of its (nonzero) digits is 3500, while the sum is 30.

Adding to 115550722011 its reverse (110227055511), we get a palindrome (225777777522).

The spelling of 115550722011 in words is "one hundred fifteen billion, five hundred fifty million, seven hundred twenty-two thousand, eleven".

Divisors: 1 3 38516907337 115550722011