Search a number
-
+
110115024530 = 2577919912301
BaseRepresentation
bin110011010001101011…
…1011110111010010010
3101112020002211211100212
41212203113132322102
53301003421241110
6122330335044122
710645516156640
oct1464327367222
9345202754325
10110115024530
1142777073805
1219411370642
13a4cb2a1264
1454885a6190
152ce7268e05
hex19a35dee92

110115024530 has 32 divisors (see below), whose sum is σ = 229389719040. Its totient is φ = 37275825600.

The previous prime is 110115024521. The next prime is 110115024581. The reversal of 110115024530 is 35420511011.

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

It is an unprimeable number.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9950621 + ... + 9961680.

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

Almost surely, 2110115024530 is an apocalyptic number.

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

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

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 19912394.

The product of its (nonzero) digits is 600, while the sum is 23.

Adding to 110115024530 its reverse (35420511011), we get a palindrome (145535535541).

The spelling of 110115024530 in words is "one hundred ten billion, one hundred fifteen million, twenty-four thousand, five hundred thirty".

Divisors: 1 2 5 7 10 14 35 70 79 158 395 553 790 1106 2765 5530 19912301 39824602 99561505 139386107 199123010 278772214 696930535 1393861070 1573071779 3146143558 7865358895 11011502453 15730717790 22023004906 55057512265 110115024530