Search a number
-
+
11201101330 = 2510710468319
BaseRepresentation
bin10100110111010001…
…10011111000010010
31001220121211220101211
422123220303320102
5140414440220310
65051250250334
7544400535046
oct123350637022
931817756354
1011201101330
114828803241
1222072869aa
1310967a9013
1478389c026
15458564c8a
hex29ba33e12

11201101330 has 16 divisors (see below), whose sum is σ = 20350414080. Its totient is φ = 4438566832.

The previous prime is 11201101291. The next prime is 11201101343. The reversal of 11201101330 is 3310110211.

11201101330 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 11201101330.

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, 5233090 + ... + 5235229.

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

Almost surely, 211201101330 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 10468433.

The product of its (nonzero) digits is 18, while the sum is 13.

Adding to 11201101330 its reverse (3310110211), we get a palindrome (14511211541).

The spelling of 11201101330 in words is "eleven billion, two hundred one million, one hundred one thousand, three hundred thirty".

Divisors: 1 2 5 10 107 214 535 1070 10468319 20936638 52341595 104683190 1120110133 2240220266 5600550665 11201101330