Search a number
-
+
11009169215 = 511200166713
BaseRepresentation
bin10100100000011001…
…01001011100111111
31001102020200202000222
422100030221130333
5140021321403330
65020232411555
7536550252152
oct122014513477
931366622028
1011009169215
11473a430860
122172b46bbb
131065ab8015
147661b9c99
154467a10e5
hex29032973f

11009169215 has 8 divisors (see below), whose sum is σ = 14412003408. Its totient is φ = 8006668480.

The previous prime is 11009169211. The next prime is 11009169271. The reversal of 11009169215 is 51296190011.

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

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 11009169215 - 22 = 11009169211 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11009169211) 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 7 ways as a sum of consecutive naturals, for example, 100083302 + ... + 100083411.

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

Almost surely, 211009169215 is an apocalyptic number.

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

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

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

The sum of its prime factors is 200166729.

The product of its (nonzero) digits is 4860, while the sum is 35.

The spelling of 11009169215 in words is "eleven billion, nine million, one hundred sixty-nine thousand, two hundred fifteen".

Divisors: 1 5 11 55 200166713 1000833565 2201833843 11009169215