Search a number
-
+
1011011111013 = 33078591094669
BaseRepresentation
bin11101011011001001111…
…01010100100001100101
310120122121002202211011110
432231210331110201211
5113031022321023023
62052241352455233
7133020540436341
oct16554475244145
93518532684143
101011011111013
1135a849462642
12143b356aa519
13744515b3647
1436d0c9aa621
151b47329ca93
hexeb64f54865

1011011111013 has 8 divisors (see below), whose sum is σ = 1348020424800. Its totient is φ = 674004602288.

The previous prime is 1011011111009. The next prime is 1011011111087. The reversal of 1011011111013 is 3101111101101.

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 1011011111013 - 22 = 1011011111009 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1011011111013.

It is a congruent number.

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

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

Almost surely, 21011011111013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1402531.

The product of its (nonzero) digits is 3, while the sum is 12.

Adding to 1011011111013 its reverse (3101111101101), we get a palindrome (4112122212114).

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

Divisors: 1 3 307859 923577 1094669 3284007 337003703671 1011011111013