Search a number
-
+
13111011130 = 257187300159
BaseRepresentation
bin11000011010111101…
…00010011100111010
31020211201200101002211
430031132202130322
5203322404324010
610004554245334
7642621520150
oct141536423472
936751611084
1013111011130
115618907798
12265aa2684a
13130c39c369
148c53c53d0
1551b07e08a
hex30d7a273a

13111011130 has 16 divisors (see below), whose sum is σ = 26971223040. Its totient is φ = 4495203792.

The previous prime is 13111011127. The next prime is 13111011187. The reversal of 13111011130 is 3111011131.

It is a super-2 number, since 2×131110111302 (a number of 21 digits) contains 22 as substring.

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

It is an unprimeable number.

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

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

Almost surely, 213111011130 is an apocalyptic number.

13111011130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

13111011130 is an abundant number, since it is smaller than the sum of its proper divisors (13860211910).

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

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

The sum of its prime factors is 187300173.

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

Adding to 13111011130 its reverse (3111011131), we get a palindrome (16222022261).

Subtracting from 13111011130 its reverse (3111011131), we obtain a palindrome (9999999999).

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

Divisors: 1 2 5 7 10 14 35 70 187300159 374600318 936500795 1311101113 1873001590 2622202226 6555505565 13111011130