Search a number
-
+
11101101111 = 34137050631
BaseRepresentation
bin10100101011010110…
…10101110000110111
31001122122200100220000
422111223111300313
5140213340213421
65033315042343
7542044542162
oct122553256067
931578610800
1011101101111
114787311631
1221998a03b3
13107bb653a9
147744aaad9
1544e8b0226
hex295ad5c37

11101101111 has 10 divisors (see below), whose sum is σ = 16583126472. Its totient is φ = 7400734020.

The previous prime is 11101101107. The next prime is 11101101131. The reversal of 11101101111 is 11110110111.

It is not a de Polignac number, because 11101101111 - 22 = 11101101107 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 68525235 + ... + 68525396.

Almost surely, 211101101111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 137050643 (or 137050634 counting only the distinct ones).

The product of its (nonzero) digits is 1, while the sum is 9.

Adding to 11101101111 its reverse (11110110111), we get a palindrome (22211211222).

The spelling of 11101101111 in words is "eleven billion, one hundred one million, one hundred one thousand, one hundred eleven".

Divisors: 1 3 9 27 81 137050631 411151893 1233455679 3700367037 11101101111