Search a number
-
+
1011112011113 = 3221601152223
BaseRepresentation
bin11101011011010101111…
…10001110010101101001
310120122212010122002002012
432231222332032111221
5113031224133323423
62052255355245305
7133023204200621
oct16555276162551
93518763562065
101011112011113
1135a8a0409356
12143b63449835
1374469480a49
1436d1c153881
151b47c07e078
hexeb6af8e569

1011112011113 has 8 divisors (see below), whose sum is σ = 1011613556736. Its totient is φ = 1010610588400.

The previous prime is 1011112011089. The next prime is 1011112011121. The reversal of 1011112011113 is 3111102111101.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1011112011113 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

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

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

Almost surely, 21011112011113 is an apocalyptic number.

It is an amenable number.

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

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

1011112011113 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 61455.

The product of its (nonzero) digits is 6, while the sum is 14.

Adding to 1011112011113 its reverse (3111102111101), we get a palindrome (4122214122214).

The spelling of 1011112011113 in words is "one trillion, eleven billion, one hundred twelve million, eleven thousand, one hundred thirteen".

Divisors: 1 3221 6011 52223 19361431 168210283 313912453 1011112011113