Search a number
-
+
115706566655 = 523141313331
BaseRepresentation
bin110101111000010100…
…1100001011111111111
3102001122210022121011122
41223300221201133333
53343431340113110
6125053241141155
711234213406011
oct1536051413777
9361583277148
10115706566655
11450863820a9
121a511a8a7bb
13abac856a74
14585904c1b1
1530230bc255
hex1af0a617ff

115706566655 has 4 divisors (see below), whose sum is σ = 138847879992. Its totient is φ = 92565253320.

The previous prime is 115706566639. The next prime is 115706566697. The reversal of 115706566655 is 556665607511.

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

It is not a de Polignac number, because 115706566655 - 24 = 115706566639 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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 3 ways as a sum of consecutive naturals, for example, 11570656661 + ... + 11570656670.

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

Almost surely, 2115706566655 is an apocalyptic number.

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

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

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

The sum of its prime factors is 23141313336.

The product of its (nonzero) digits is 5670000, while the sum is 53.

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

Divisors: 1 5 23141313331 115706566655