Search a number
-
+
11931559048059 = 37568169478479
BaseRepresentation
bin1010110110100000100001…
…0101101011001101111011
31120020122102212100111210120
42231220020111223031323
53030441313104014214
641213141010544323
72341012104351330
oct255501025531573
946218385314716
1011931559048059
113890167033702
1214084bab980a3
136871ab2700a1
142d36c207a987
1515a57961eea9
hexada0856b37b

11931559048059 has 8 divisors (see below), whose sum is σ = 18181423311360. Its totient is φ = 6818033741736.

The previous prime is 11931559048051. The next prime is 11931559048099. The reversal of 11931559048059 is 95084095513911.

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

It is not a de Polignac number, because 11931559048059 - 23 = 11931559048051 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 11931559047993 and 11931559048011.

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

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

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

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

Almost surely, 211931559048059 is an apocalyptic number.

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

11931559048059 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 568169478489.

The product of its (nonzero) digits is 8748000, while the sum is 60.

The spelling of 11931559048059 in words is "eleven trillion, nine hundred thirty-one billion, five hundred fifty-nine million, forty-eight thousand, fifty-nine".

Divisors: 1 3 7 21 568169478479 1704508435437 3977186349353 11931559048059