Search a number
-
+
10113103011111 = 328111996563477
BaseRepresentation
bin1001001100101010001111…
…1010011001110100100111
31022210210200112111112012220
42103022203322121310213
52311143113332323421
633301521223043423
72062435056153342
oct223124372316447
938723615445186
1010113103011111
113249a41002321
121173ba18a0573
1358487a495b79
1426d696491459
151280e967b3c6
hex932a3e99d27

10113103011111 has 8 divisors (see below), whose sum is σ = 13532123603184. Its totient is φ = 6718075546560.

The previous prime is 10113103011103. The next prime is 10113103011161. The reversal of 10113103011111 is 11111030131101.

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

It is not a de Polignac number, because 10113103011111 - 23 = 10113103011103 is a prime.

It is a congruent number.

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

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

Almost surely, 210113103011111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 11996563761.

The product of its (nonzero) digits is 9, while the sum is 15.

Adding to 10113103011111 its reverse (11111030131101), we get a palindrome (21224133142212).

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

Divisors: 1 3 281 843 11996563477 35989690431 3371034337037 10113103011111