Search a number
-
+
11519909971 = 173691183593
BaseRepresentation
bin10101011101010001…
…11110000001010011
31002201211202001122021
422232220332001103
5142043044104341
65143035352311
7555321422233
oct125650760123
932654661567
1011519909971
114981763959
122295bb2697
131117860b9b
147b3d69cc3
1547653b9d1
hex2aea3e053

11519909971 has 8 divisors (see below), whose sum is σ = 12200922864. Its totient is φ = 10839271680.

The previous prime is 11519909959. The next prime is 11519910013. The reversal of 11519909971 is 17990991511.

11519909971 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 a cyclic number.

It is not a de Polignac number, because 11519909971 - 29 = 11519909459 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (11519909771) 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, 29050 + ... + 154543.

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

Almost surely, 211519909971 is an apocalyptic number.

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

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

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

The sum of its prime factors is 187301.

The product of its (nonzero) digits is 229635, while the sum is 52.

The spelling of 11519909971 in words is "eleven billion, five hundred nineteen million, nine hundred nine thousand, nine hundred seventy-one".

Divisors: 1 17 3691 62747 183593 3121081 677641763 11519909971