Search a number
-
+
115660550161 = 138896965397
BaseRepresentation
bin110101110110111100…
…1111111000000010001
3102001112120201201102001
41223231321333000101
53343333100101121
6125044514554001
711233114312102
oct1535571770021
9361476651361
10115660550161
1145062402242
121a4ba598901
13aba3164880
145852cb03a9
15301e02c991
hex1aede7f011

115660550161 has 4 divisors (see below), whose sum is σ = 124557515572. Its totient is φ = 106763584752.

The previous prime is 115660550149. The next prime is 115660550197. The reversal of 115660550161 is 161055066511.

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

It can be written as a sum of positive squares in 2 ways, for example, as 10088193600 + 105572356561 = 100440^2 + 324919^2 .

It is a cyclic number.

It is not a de Polignac number, because 115660550161 - 29 = 115660549649 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 115660550161.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4448482686 + ... + 4448482711.

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

Almost surely, 2115660550161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 8896965410.

The product of its (nonzero) digits is 27000, while the sum is 37.

The spelling of 115660550161 in words is "one hundred fifteen billion, six hundred sixty million, five hundred fifty thousand, one hundred sixty-one".

Divisors: 1 13 8896965397 115660550161