Search a number
-
+
115165601111 = 1110469600101
BaseRepresentation
bin110101101000001100…
…1111001110101010111
3102000021002101200221202
41223100121321311113
53341324343213421
6124523434303115
711214624313001
oct1532031716527
9360232350852
10115165601111
1144928a85740
121a3a0887a9b
13ab2475a802
145807271371
152ee086110b
hex1ad0679d57

115165601111 has 4 divisors (see below), whose sum is σ = 125635201224. Its totient is φ = 104696001000.

The previous prime is 115165601051. The next prime is 115165601137. The reversal of 115165601111 is 111106561511.

It is a happy number.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-115165601111 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2115165601111 is an apocalyptic number.

115165601111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

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

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

The sum of its prime factors is 10469600112.

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

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

Divisors: 1 11 10469600101 115165601111