Search a number
-
+
113110010113 = 1937011608527
BaseRepresentation
bin110100101010111100…
…0011100100100000001
3101210221211102212012211
41221111320130210001
53323122130310423
6123543444022121
711112654136222
oct1512570344401
9353854385184
10113110010113
1143a73719801
1219b08391941
13a88791b289
145690265249
152e2016c10d
hex1a55e1c901

113110010113 has 8 divisors (see below), whose sum is σ = 119095413120. Its totient is φ = 107127831600.

The previous prime is 113110010087. The next prime is 113110010129. The reversal of 113110010113 is 311010011311.

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-113110010113 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 2113110010113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1612247.

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

Adding to 113110010113 its reverse (311010011311), we get a palindrome (424120021424).

The spelling of 113110010113 in words is "one hundred thirteen billion, one hundred ten million, ten thousand, one hundred thirteen".

Divisors: 1 19 3701 70319 1608527 30562013 5953158427 113110010113