Search a number
-
+
11110001102 = 210767377141
BaseRepresentation
bin10100101100011010…
…10010100111001110
31001200021102112101022
422112031102213032
5140223130013402
65034233514142
7542213310524
oct122615224716
931607375338
1011110001102
1147913402a2
1221a0872952
131080960365
14775746314
1545056c2a2
hex2963529ce

11110001102 has 16 divisors (see below), whose sum is σ = 16845961392. Its totient is φ = 5494836480.

The previous prime is 11110001069. The next prime is 11110001129. The reversal of 11110001102 is 20110001111.

It is a happy number.

11110001102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a self number, because there is not a number n which added to its sum of digits gives 11110001102.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 105452 + ... + 182592.

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

Almost surely, 211110001102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 77923.

The product of its (nonzero) digits is 2, while the sum is 8.

Adding to 11110001102 its reverse (20110001111), we get a palindrome (31220002213).

Subtracting 11110001102 from its reverse (20110001111), we obtain a palindrome (9000000009).

The spelling of 11110001102 in words is "eleven billion, one hundred ten million, one thousand, one hundred two".

Divisors: 1 2 107 214 673 1346 72011 77141 144022 154282 8254087 16508174 51915893 103831786 5555000551 11110001102