Search a number
-
+
115561010161 = 266343395047
BaseRepresentation
bin110101110011111111…
…0010001001111110001
3102001021122102120012101
41223213332101033301
53343132104311121
6125031001300401
711230465244032
oct1534776211761
9361248376171
10115561010161
11450111a5383
121a491194701
13ab8865256c
14584399ca89
153015419491
hex1ae7f913f1

115561010161 has 4 divisors (see below), whose sum is σ = 115604407872. Its totient is φ = 115517612452.

The previous prime is 115561010111. The next prime is 115561010183. The reversal of 115561010161 is 161010165511.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 115561010161 - 29 = 115561009649 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (115561010111) 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, 21694861 + ... + 21700186.

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

Almost surely, 2115561010161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 43397710.

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

Adding to 115561010161 its reverse (161010165511), we get a palindrome (276571175672).

The spelling of 115561010161 in words is "one hundred fifteen billion, five hundred sixty-one million, ten thousand, one hundred sixty-one".

Divisors: 1 2663 43395047 115561010161