Search a number
-
+
11013103209 = 319627730781
BaseRepresentation
bin10100100000110111…
…01001111001101001
31001102112002121110110
422100123221321221
5140023323300314
65020453004533
7536625555423
oct122033517151
931375077413
1011013103209
114741678499
122174323749
131066864824
14766921813
15446ccba59
hex2906e9e69

11013103209 has 16 divisors (see below), whose sum is σ = 15459951680. Its totient is φ = 6954310080.

The previous prime is 11013103177. The next prime is 11013103267. The reversal of 11013103209 is 90230131011.

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

It is not a de Polignac number, because 11013103209 - 25 = 11013103177 is a prime.

It is a Duffinian number.

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

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 15 ways as a sum of consecutive naturals, for example, 342399 + ... + 373179.

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

Almost surely, 211013103209 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 37080.

The product of its (nonzero) digits is 162, while the sum is 21.

The spelling of 11013103209 in words is "eleven billion, thirteen million, one hundred three thousand, two hundred nine".

Divisors: 1 3 19 57 6277 18831 30781 92343 119263 357789 584839 1754517 193212337 579637011 3671034403 11013103209