Search a number
-
+
111660340315013 = 715951477187859
BaseRepresentation
bin11001011000110111110010…
…111010111000001110000101
3112122100121212002202212021022
4121120313302322320032011
5104113420334110040023
61033252015135000525
732343123216400430
oct3130676272701605
9478317762685238
10111660340315013
113263a980146416
1210634632069145
134a3c6a92c94b9
141d8056438a817
15cd981d36d7c8
hex658df2eb8385

111660340315013 has 4 divisors (see below), whose sum is σ = 127611817502880. Its totient is φ = 95708863127148.

The previous prime is 111660340315003. The next prime is 111660340315019. The reversal of 111660340315013 is 310513043066111.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 111660340315013 - 26 = 111660340314949 is a prime.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7975738593923 + ... + 7975738593936.

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

Almost surely, 2111660340315013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 15951477187866.

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

The spelling of 111660340315013 in words is "one hundred eleven trillion, six hundred sixty billion, three hundred forty million, three hundred fifteen thousand, thirteen".

Divisors: 1 7 15951477187859 111660340315013