Search a number
-
+
101111131113 = 333703710371
BaseRepresentation
bin101111000101010110…
…0010110101111101001
3100122222121102122120220
41132022230112233221
53124033422143423
6114241054240253
710206425301546
oct1361254265751
9318877378526
10101111131113
1139976663383
1217719ab6089
1396c4a89a85
144c72859bcd
15296ba6d9e3
hex178ab16be9

101111131113 has 4 divisors (see below), whose sum is σ = 134814841488. Its totient is φ = 67407420740.

The previous prime is 101111131049. The next prime is 101111131129. The reversal of 101111131113 is 311131111101.

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 101111131113 - 26 = 101111131049 is a prime.

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

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

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

Almost surely, 2101111131113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 33703710374.

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

Adding to 101111131113 its reverse (311131111101), we get a palindrome (412242242214).

The spelling of 101111131113 in words is "one hundred one billion, one hundred eleven million, one hundred thirty-one thousand, one hundred thirteen".

Divisors: 1 3 33703710371 101111131113